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.r280-smll-167863550600397.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 marciexred
Input is Peterson-PT-6, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-smll-167863550600397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678921596896

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=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 23:06:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 23:06:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:06:40] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-15 23:06:40] [INFO ] Transformed 1330 places.
[2023-03-15 23:06:40] [INFO ] Transformed 2030 transitions.
[2023-03-15 23:06:40] [INFO ] Found NUPN structural information;
[2023-03-15 23:06:40] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-15 23:06:40] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 438 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 5 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 141 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2023-03-15 23:06:40] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2023-03-15 23:06:40] [INFO ] Computed 27 place invariants in 29 ms
[2023-03-15 23:06:41] [INFO ] Implicit Places using invariants in 930 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 978 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 9 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1129 ms. Remains : 399/1330 places, 1106/2030 transitions.
Discarding 7 transitions out of 1106. Remains 1099
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1591 ms. (steps per millisecond=6 ) properties (out of 1099) seen :421
Running SMT prover for 678 properties.
[2023-03-15 23:06:43] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:06:43] [INFO ] Computed 20 place invariants in 11 ms
[2023-03-15 23:06:49] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 23:07:08] [INFO ] After 12664ms SMT Verify possible using state equation in real domain returned unsat :0 sat :383 real:295
[2023-03-15 23:07:08] [INFO ] State equation strengthened by 330 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-15 23:07:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:07:08] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 678 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 372 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 50 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 349678 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 94
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 584) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 575) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 567) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 561) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 560) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 557) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 556) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 553) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 550) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 548) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 548) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 546) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 545) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 544) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 538) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 538) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 538) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 536) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 533) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 533) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 531) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 527) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 526) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 526) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 526) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 526) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 526) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 525) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 524) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 523) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 523) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 523) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 523) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 522) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 521) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 521) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 520) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 520) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 518) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 518) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 513) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 513) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 510) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 509) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 509) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 505) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 505) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 504) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 503) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 501) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 498) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 498) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 496) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 495) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 493) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 493) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 492) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 491) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 491) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 491) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 491) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 491) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 490) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 487) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 486) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 486) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 486) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 486) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 486) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 483) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 483) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 482) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 482) seen :0
Running SMT prover for 482 properties.
[2023-03-15 23:07:42] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:07:42] [INFO ] Invariant cache hit.
[2023-03-15 23:07:48] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 23:08:22] [INFO ] After 40255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:482
[2023-03-15 23:08:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 23:08:57] [INFO ] After 22550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :482
[2023-03-15 23:08:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:09:17] [INFO ] After 20080ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :482
[2023-03-15 23:09:17] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 10 ms to minimize.
[2023-03-15 23:09:18] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:09:18] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 2 ms to minimize.
[2023-03-15 23:09:18] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 2 ms to minimize.
[2023-03-15 23:09:19] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2023-03-15 23:09:19] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:09:19] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:09:20] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:09:20] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:09:20] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 2 ms to minimize.
[2023-03-15 23:09:20] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-15 23:09:21] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:09:21] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:09:21] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:09:21] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:09:22] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:09:22] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:09:22] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:09:22] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:09:23] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:09:23] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 0 ms to minimize.
[2023-03-15 23:09:23] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:09:24] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:09:24] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:09:24] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:09:24] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-15 23:09:25] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2023-03-15 23:09:25] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7363 ms
[2023-03-15 23:09:25] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2023-03-15 23:09:25] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 0 ms to minimize.
[2023-03-15 23:09:25] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:09:26] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:09:26] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2023-03-15 23:09:26] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:09:26] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:09:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1629 ms
[2023-03-15 23:09:27] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
[2023-03-15 23:09:27] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:09:27] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 2 ms to minimize.
[2023-03-15 23:09:27] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:09:27] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:09:28] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
[2023-03-15 23:09:28] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 0 ms to minimize.
[2023-03-15 23:09:28] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:09:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1973 ms
[2023-03-15 23:09:29] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:09:29] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 0 ms to minimize.
[2023-03-15 23:09:29] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 0 ms to minimize.
[2023-03-15 23:09:30] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:09:30] [INFO ] Deduced a trap composed of 71 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:09:30] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 0 ms to minimize.
[2023-03-15 23:09:30] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:09:31] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:09:31] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 2 ms to minimize.
[2023-03-15 23:09:31] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 1 ms to minimize.
[2023-03-15 23:09:32] [INFO ] Deduced a trap composed of 71 places in 213 ms of which 1 ms to minimize.
[2023-03-15 23:09:32] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:09:32] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2023-03-15 23:09:32] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:09:33] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 3 ms to minimize.
[2023-03-15 23:09:33] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:09:33] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:09:33] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:09:34] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:09:34] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:09:34] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 1 ms to minimize.
[2023-03-15 23:09:35] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 2 ms to minimize.
[2023-03-15 23:09:35] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:09:35] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:09:35] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:09:36] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:09:36] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:09:36] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:09:37] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2023-03-15 23:09:37] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 0 ms to minimize.
[2023-03-15 23:09:37] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 0 ms to minimize.
[2023-03-15 23:09:37] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:09:38] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2023-03-15 23:09:38] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:09:38] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 0 ms to minimize.
[2023-03-15 23:09:38] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 0 ms to minimize.
[2023-03-15 23:09:39] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:09:39] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:09:39] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:09:39] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:09:40] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 1 ms to minimize.
[2023-03-15 23:09:40] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 1 ms to minimize.
[2023-03-15 23:09:40] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:09:41] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 0 ms to minimize.
[2023-03-15 23:09:41] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-15 23:09:41] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:09:41] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2023-03-15 23:09:42] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2023-03-15 23:09:42] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:09:43] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-15 23:09:43] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-15 23:09:43] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 14453 ms
[2023-03-15 23:09:43] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:09:44] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 0 ms to minimize.
[2023-03-15 23:09:44] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:09:44] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:09:44] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:09:45] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2023-03-15 23:09:45] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:09:45] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-15 23:09:45] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2023-03-15 23:09:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2118 ms
[2023-03-15 23:09:46] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:09:46] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:09:46] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:09:46] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:09:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1138 ms
[2023-03-15 23:09:47] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2023-03-15 23:09:47] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:09:47] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2023-03-15 23:09:48] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2023-03-15 23:09:48] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:09:48] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2023-03-15 23:09:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3032 ms
[2023-03-15 23:09:50] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:09:50] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 1 ms to minimize.
[2023-03-15 23:09:51] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:09:51] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 1 ms to minimize.
[2023-03-15 23:09:51] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 0 ms to minimize.
[2023-03-15 23:09:52] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:09:52] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2023-03-15 23:09:52] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 0 ms to minimize.
[2023-03-15 23:09:53] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:09:53] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:09:53] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-15 23:09:54] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:09:54] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:09:54] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 0 ms to minimize.
[2023-03-15 23:09:55] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 0 ms to minimize.
[2023-03-15 23:09:55] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:09:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5362 ms
[2023-03-15 23:09:56] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:09:56] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2023-03-15 23:09:56] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 1 ms to minimize.
[2023-03-15 23:09:57] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2023-03-15 23:09:57] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2023-03-15 23:09:57] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 1 ms to minimize.
[2023-03-15 23:09:57] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2023-03-15 23:09:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1718 ms
[2023-03-15 23:09:58] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:09:58] [INFO ] Deduced a trap composed of 34 places in 305 ms of which 0 ms to minimize.
[2023-03-15 23:09:59] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:09:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1055 ms
[2023-03-15 23:10:00] [INFO ] Deduced a trap composed of 27 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:10:00] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:10:00] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 0 ms to minimize.
[2023-03-15 23:10:01] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 2 ms to minimize.
[2023-03-15 23:10:01] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2023-03-15 23:10:01] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:10:02] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 0 ms to minimize.
[2023-03-15 23:10:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2512 ms
[2023-03-15 23:10:02] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:10:02] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:10:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 803 ms
[2023-03-15 23:10:03] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:10:04] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:10:04] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:10:04] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:10:05] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:10:05] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 1 ms to minimize.
[2023-03-15 23:10:05] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:10:06] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:10:06] [INFO ] Deduced a trap composed of 50 places in 383 ms of which 1 ms to minimize.
[2023-03-15 23:10:06] [INFO ] Deduced a trap composed of 45 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:10:07] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:10:07] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:10:07] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:10:08] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:10:08] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:10:08] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2023-03-15 23:10:08] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 0 ms to minimize.
[2023-03-15 23:10:09] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:10:09] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 0 ms to minimize.
[2023-03-15 23:10:09] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 0 ms to minimize.
[2023-03-15 23:10:10] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:10:10] [INFO ] Deduced a trap composed of 52 places in 414 ms of which 1 ms to minimize.
[2023-03-15 23:10:10] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2023-03-15 23:10:11] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:10:11] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:10:11] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 1 ms to minimize.
[2023-03-15 23:10:12] [INFO ] Deduced a trap composed of 39 places in 387 ms of which 1 ms to minimize.
[2023-03-15 23:10:12] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:10:13] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:10:13] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:10:14] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:10:14] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:10:14] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 1 ms to minimize.
[2023-03-15 23:10:15] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:10:16] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 1 ms to minimize.
[2023-03-15 23:10:16] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 12921 ms
[2023-03-15 23:10:17] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-15 23:10:17] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 1 ms to minimize.
[2023-03-15 23:10:18] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:10:18] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:10:18] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:10:18] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 0 ms to minimize.
[2023-03-15 23:10:19] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:10:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1933 ms
[2023-03-15 23:10:19] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:10:19] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 0 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 0 ms to minimize.
[2023-03-15 23:10:20] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 1 ms to minimize.
[2023-03-15 23:10:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1662 ms
[2023-03-15 23:10:22] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-15 23:10:22] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-15 23:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 23:10:23] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2023-03-15 23:10:23] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2023-03-15 23:10:23] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 1 ms to minimize.
[2023-03-15 23:10:23] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:10:24] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-15 23:10:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1257 ms
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2023-03-15 23:10:25] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2023-03-15 23:10:26] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2023-03-15 23:10:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1294 ms
[2023-03-15 23:10:26] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:10:27] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2023-03-15 23:10:27] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2023-03-15 23:10:27] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-03-15 23:10:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1032 ms
[2023-03-15 23:10:28] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 0 ms to minimize.
[2023-03-15 23:10:28] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:10:29] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 0 ms to minimize.
[2023-03-15 23:10:29] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2023-03-15 23:10:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1357 ms
[2023-03-15 23:10:30] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-15 23:10:30] [INFO ] Deduced a trap composed of 53 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:10:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1109 ms
[2023-03-15 23:10:32] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 1 ms to minimize.
[2023-03-15 23:10:32] [INFO ] Deduced a trap composed of 60 places in 366 ms of which 0 ms to minimize.
[2023-03-15 23:10:32] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:10:33] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:10:33] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:10:33] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 1 ms to minimize.
[2023-03-15 23:10:34] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2023-03-15 23:10:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2450 ms
[2023-03-15 23:10:34] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:10:34] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:10:35] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:10:35] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2023-03-15 23:10:35] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 0 ms to minimize.
[2023-03-15 23:10:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1769 ms
[2023-03-15 23:10:37] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:10:37] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2023-03-15 23:10:37] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:10:38] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:10:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1388 ms
[2023-03-15 23:10:39] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2023-03-15 23:10:39] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2023-03-15 23:10:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-15 23:10:40] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:10:41] [INFO ] Deduced a trap composed of 50 places in 281 ms of which 1 ms to minimize.
[2023-03-15 23:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1075 ms
[2023-03-15 23:10:42] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2023-03-15 23:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 23:10:43] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2023-03-15 23:10:44] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:10:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 675 ms
[2023-03-15 23:10:45] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:10:45] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 0 ms to minimize.
[2023-03-15 23:10:46] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-15 23:10:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 986 ms
[2023-03-15 23:10:47] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:10:47] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2023-03-15 23:10:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2023-03-15 23:10:52] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2023-03-15 23:10:52] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2023-03-15 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-03-15 23:10:53] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2023-03-15 23:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 736 ms
[2023-03-15 23:10:54] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2023-03-15 23:10:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 23:10:54] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 0 ms to minimize.
[2023-03-15 23:10:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-15 23:10:56] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 1 ms to minimize.
[2023-03-15 23:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-15 23:10:56] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2023-03-15 23:10:57] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:10:57] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:10:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 687 ms
[2023-03-15 23:10:57] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:10:58] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:10:58] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:10:58] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:10:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1092 ms
[2023-03-15 23:10:59] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 0 ms to minimize.
[2023-03-15 23:10:59] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:11:00] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 0 ms to minimize.
[2023-03-15 23:11:00] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:11:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1026 ms
[2023-03-15 23:11:00] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2023-03-15 23:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 23:11:01] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 0 ms to minimize.
[2023-03-15 23:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 23:11:02] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-15 23:11:03] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:11:03] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:11:03] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:11:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 822 ms
[2023-03-15 23:11:04] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:11:04] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-15 23:11:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2023-03-15 23:11:05] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 0 ms to minimize.
[2023-03-15 23:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 23:11:06] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2023-03-15 23:11:06] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 0 ms to minimize.
[2023-03-15 23:11:06] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2023-03-15 23:11:07] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:11:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 778 ms
[2023-03-15 23:11:07] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2023-03-15 23:11:08] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:11:08] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:11:08] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:11:08] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:11:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1848 ms
[2023-03-15 23:11:09] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 0 ms to minimize.
[2023-03-15 23:11:09] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:11:10] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 0 ms to minimize.
[2023-03-15 23:11:10] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2023-03-15 23:11:10] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 0 ms to minimize.
[2023-03-15 23:11:10] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 1 ms to minimize.
[2023-03-15 23:11:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1389 ms
[2023-03-15 23:11:11] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 0 ms to minimize.
[2023-03-15 23:11:11] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 0 ms to minimize.
[2023-03-15 23:11:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2023-03-15 23:11:12] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 1 ms to minimize.
[2023-03-15 23:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-15 23:11:12] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:11:13] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:11:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-15 23:11:14] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 0 ms to minimize.
[2023-03-15 23:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 23:11:15] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:11:15] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-03-15 23:11:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-15 23:11:16] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 1 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 1 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 1 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 1 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 1 ms to minimize.
[2023-03-15 23:11:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1391 ms
[2023-03-15 23:11:18] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 23:11:20] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-15 23:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 23:11:21] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-15 23:11:22] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 23:11:24] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-15 23:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-15 23:11:26] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-15 23:11:27] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-15 23:11:27] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-15 23:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-15 23:11:28] [INFO ] Deduced a trap composed of 76 places in 325 ms of which 1 ms to minimize.
[2023-03-15 23:11:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2023-03-15 23:11:29] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 1 ms to minimize.
[2023-03-15 23:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-15 23:11:30] [INFO ] Deduced a trap composed of 36 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:11:31] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:11:32] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 1 ms to minimize.
[2023-03-15 23:11:32] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 1 ms to minimize.
[2023-03-15 23:11:32] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 1 ms to minimize.
[2023-03-15 23:11:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3092 ms
[2023-03-15 23:11:33] [INFO ] Deduced a trap composed of 43 places in 404 ms of which 1 ms to minimize.
[2023-03-15 23:11:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-15 23:11:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-15 23:11:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-15 23:11:38] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-15 23:11:39] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1111 ms
[2023-03-15 23:11:40] [INFO ] Deduced a trap composed of 47 places in 392 ms of which 1 ms to minimize.
[2023-03-15 23:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-15 23:11:41] [INFO ] Deduced a trap composed of 14 places in 353 ms of which 2 ms to minimize.
[2023-03-15 23:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-15 23:11:45] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:11:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-15 23:11:46] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-15 23:11:48] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 23:11:49] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2023-03-15 23:11:49] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:11:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 832 ms
[2023-03-15 23:11:50] [INFO ] Deduced a trap composed of 30 places in 360 ms of which 0 ms to minimize.
[2023-03-15 23:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-15 23:11:51] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:11:51] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 879 ms
[2023-03-15 23:11:53] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 1 ms to minimize.
[2023-03-15 23:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-15 23:11:58] [INFO ] Deduced a trap composed of 62 places in 351 ms of which 1 ms to minimize.
[2023-03-15 23:11:58] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 1 ms to minimize.
[2023-03-15 23:11:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1223 ms
[2023-03-15 23:12:00] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2023-03-15 23:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2023-03-15 23:12:06] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 1 ms to minimize.
[2023-03-15 23:12:06] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:12:06] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 0 ms to minimize.
[2023-03-15 23:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1473 ms
[2023-03-15 23:12:08] [INFO ] Deduced a trap composed of 2 places in 467 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-15 23:12:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:12:08] [INFO ] After 225495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:482
Fused 482 Parikh solutions to 461 different solutions.
Parikh walk visited 4 properties in 12445 ms.
Support contains 309 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 29 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 437271 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 442) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 439) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 439) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 439) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 435) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 435) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 434) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 434) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 430) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 421) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 411) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 410) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 409) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 407) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 403) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 399) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 390) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 388) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 386) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 384) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 382) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 377) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 376) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 374) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 373) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 371) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 369) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 368) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Running SMT prover for 367 properties.
[2023-03-15 23:13:03] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:13:03] [INFO ] Invariant cache hit.
[2023-03-15 23:13:07] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 23:13:22] [INFO ] After 11862ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:356
[2023-03-15 23:13:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:13:22] [INFO ] After 500ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:13:22] [INFO ] After 18566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:13:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:13:41] [INFO ] After 13191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2023-03-15 23:13:55] [INFO ] After 13787ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2023-03-15 23:13:55] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 1 ms to minimize.
[2023-03-15 23:13:56] [INFO ] Deduced a trap composed of 36 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:13:56] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:13:57] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:13:57] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 1 ms to minimize.
[2023-03-15 23:13:58] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 1 ms to minimize.
[2023-03-15 23:13:58] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:13:58] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:13:59] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 5 ms to minimize.
[2023-03-15 23:13:59] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 1 ms to minimize.
[2023-03-15 23:13:59] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:14:00] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:14:00] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 0 ms to minimize.
[2023-03-15 23:14:00] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 1 ms to minimize.
[2023-03-15 23:14:01] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 2 ms to minimize.
[2023-03-15 23:14:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5556 ms
[2023-03-15 23:14:01] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:14:02] [INFO ] Deduced a trap composed of 45 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:14:02] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 0 ms to minimize.
[2023-03-15 23:14:02] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 0 ms to minimize.
[2023-03-15 23:14:03] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:14:03] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:14:03] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:14:03] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2023-03-15 23:14:04] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:14:04] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 0 ms to minimize.
[2023-03-15 23:14:04] [INFO ] Deduced a trap composed of 56 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:14:05] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:14:05] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 0 ms to minimize.
[2023-03-15 23:14:05] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2023-03-15 23:14:06] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:14:06] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 1 ms to minimize.
[2023-03-15 23:14:06] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 1 ms to minimize.
[2023-03-15 23:14:07] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:14:07] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:14:07] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:14:08] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:14:08] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:14:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7081 ms
[2023-03-15 23:14:08] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 0 ms to minimize.
[2023-03-15 23:14:09] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:14:09] [INFO ] Deduced a trap composed of 67 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:14:10] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 0 ms to minimize.
[2023-03-15 23:14:10] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:14:10] [INFO ] Deduced a trap composed of 63 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:14:11] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:14:11] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:14:11] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 1 ms to minimize.
[2023-03-15 23:14:11] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2023-03-15 23:14:12] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 1 ms to minimize.
[2023-03-15 23:14:12] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:14:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4063 ms
[2023-03-15 23:14:13] [INFO ] Deduced a trap composed of 21 places in 381 ms of which 1 ms to minimize.
[2023-03-15 23:14:13] [INFO ] Deduced a trap composed of 67 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:14:14] [INFO ] Deduced a trap composed of 14 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:14:14] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 1 ms to minimize.
[2023-03-15 23:14:14] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:14:15] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:14:15] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 0 ms to minimize.
[2023-03-15 23:14:15] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:14:16] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:14:16] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 0 ms to minimize.
[2023-03-15 23:14:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3448 ms
[2023-03-15 23:14:16] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:14:17] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:14:17] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-15 23:14:17] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:14:17] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 1 ms to minimize.
[2023-03-15 23:14:18] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:14:18] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:14:18] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:14:18] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:14:19] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 0 ms to minimize.
[2023-03-15 23:14:19] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:14:19] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:14:20] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:14:20] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 1 ms to minimize.
[2023-03-15 23:14:20] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:14:21] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 0 ms to minimize.
[2023-03-15 23:14:21] [INFO ] Deduced a trap composed of 73 places in 369 ms of which 4 ms to minimize.
[2023-03-15 23:14:21] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:14:21] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:14:22] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:14:22] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:14:22] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6087 ms
[2023-03-15 23:14:22] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 0 ms to minimize.
[2023-03-15 23:14:23] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:14:23] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 0 ms to minimize.
[2023-03-15 23:14:23] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:14:24] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:14:24] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2023-03-15 23:14:24] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:14:24] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 0 ms to minimize.
[2023-03-15 23:14:25] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:14:25] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:14:25] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 0 ms to minimize.
[2023-03-15 23:14:25] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2023-03-15 23:14:25] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:14:26] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 1 ms to minimize.
[2023-03-15 23:14:26] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 0 ms to minimize.
[2023-03-15 23:14:26] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 0 ms to minimize.
[2023-03-15 23:14:26] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2023-03-15 23:14:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4021 ms
[2023-03-15 23:14:27] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:14:27] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 1 ms to minimize.
[2023-03-15 23:14:27] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 0 ms to minimize.
[2023-03-15 23:14:28] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:14:28] [INFO ] Deduced a trap composed of 47 places in 351 ms of which 1 ms to minimize.
[2023-03-15 23:14:28] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:14:29] [INFO ] Deduced a trap composed of 67 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:14:29] [INFO ] Deduced a trap composed of 35 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:14:29] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 0 ms to minimize.
[2023-03-15 23:14:30] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 0 ms to minimize.
[2023-03-15 23:14:30] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 0 ms to minimize.
[2023-03-15 23:14:30] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:14:31] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:14:31] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:14:31] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 1 ms to minimize.
[2023-03-15 23:14:32] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 1 ms to minimize.
[2023-03-15 23:14:32] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:14:32] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:14:33] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:14:33] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 2 ms to minimize.
[2023-03-15 23:14:33] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:14:34] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:14:34] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 0 ms to minimize.
[2023-03-15 23:14:34] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:14:34] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 1 ms to minimize.
[2023-03-15 23:14:34] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8034 ms
[2023-03-15 23:14:35] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2023-03-15 23:14:35] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2023-03-15 23:14:35] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 0 ms to minimize.
[2023-03-15 23:14:35] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:14:36] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2023-03-15 23:14:36] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2023-03-15 23:14:36] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 0 ms to minimize.
[2023-03-15 23:14:36] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:14:37] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
[2023-03-15 23:14:37] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:14:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2023-03-15 23:14:37] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 0 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 0 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:14:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4057 ms
[2023-03-15 23:14:39] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:14:39] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:14:39] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:14:39] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:14:40] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:14:40] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:14:40] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 0 ms to minimize.
[2023-03-15 23:14:40] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 0 ms to minimize.
[2023-03-15 23:14:41] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:14:41] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:14:41] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:14:41] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:14:42] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2023-03-15 23:14:42] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:14:42] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:14:43] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 0 ms to minimize.
[2023-03-15 23:14:43] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:14:43] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 0 ms to minimize.
[2023-03-15 23:14:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4606 ms
[2023-03-15 23:14:44] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:14:44] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 1 ms to minimize.
[2023-03-15 23:14:44] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:14:44] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:14:44] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 1 ms to minimize.
[2023-03-15 23:14:45] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 0 ms to minimize.
[2023-03-15 23:14:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1371 ms
[2023-03-15 23:14:45] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:14:45] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-15 23:14:46] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:14:46] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 0 ms to minimize.
[2023-03-15 23:14:46] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 0 ms to minimize.
[2023-03-15 23:14:47] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 0 ms to minimize.
[2023-03-15 23:14:47] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:14:47] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2023-03-15 23:14:47] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 1 ms to minimize.
[2023-03-15 23:14:48] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2023-03-15 23:14:48] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2023-03-15 23:14:48] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2023-03-15 23:14:48] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 0 ms to minimize.
[2023-03-15 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3157 ms
[2023-03-15 23:14:49] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 0 ms to minimize.
[2023-03-15 23:14:49] [INFO ] Deduced a trap composed of 59 places in 301 ms of which 1 ms to minimize.
[2023-03-15 23:14:49] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 0 ms to minimize.
[2023-03-15 23:14:50] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:14:50] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:14:50] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:14:50] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2023-03-15 23:14:51] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2023-03-15 23:14:51] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2023-03-15 23:14:51] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:14:51] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:14:51] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2023-03-15 23:14:52] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2023-03-15 23:14:52] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2023-03-15 23:14:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3337 ms
[2023-03-15 23:14:52] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 0 ms to minimize.
[2023-03-15 23:14:52] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 1 ms to minimize.
[2023-03-15 23:14:53] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:14:53] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:14:53] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 1 ms to minimize.
[2023-03-15 23:14:53] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 0 ms to minimize.
[2023-03-15 23:14:54] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 0 ms to minimize.
[2023-03-15 23:14:54] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2023-03-15 23:14:54] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-15 23:14:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2230 ms
[2023-03-15 23:14:54] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:14:55] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-15 23:14:55] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 0 ms to minimize.
[2023-03-15 23:14:55] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2023-03-15 23:14:55] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:14:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1415 ms
[2023-03-15 23:14:56] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:14:56] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 0 ms to minimize.
[2023-03-15 23:14:56] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:14:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 616 ms
[2023-03-15 23:14:57] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:14:57] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:14:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2023-03-15 23:14:57] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-15 23:14:58] [INFO ] Deduced a trap composed of 59 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:14:58] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 0 ms to minimize.
[2023-03-15 23:14:58] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 0 ms to minimize.
[2023-03-15 23:14:58] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:14:59] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:14:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1247 ms
[2023-03-15 23:14:59] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 0 ms to minimize.
[2023-03-15 23:15:00] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 1 ms to minimize.
[2023-03-15 23:15:00] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-15 23:15:00] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:15:00] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:15:01] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2023-03-15 23:15:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1780 ms
[2023-03-15 23:15:01] [INFO ] Deduced a trap composed of 77 places in 218 ms of which 1 ms to minimize.
[2023-03-15 23:15:01] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:15:01] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:15:02] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:15:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 972 ms
[2023-03-15 23:15:02] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:15:02] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:15:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 564 ms
[2023-03-15 23:15:03] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 0 ms to minimize.
[2023-03-15 23:15:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2023-03-15 23:15:04] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 1 ms to minimize.
[2023-03-15 23:15:04] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:15:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 872 ms
[2023-03-15 23:15:04] [INFO ] Deduced a trap composed of 64 places in 370 ms of which 0 ms to minimize.
[2023-03-15 23:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-15 23:15:05] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 1 ms to minimize.
[2023-03-15 23:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-15 23:15:06] [INFO ] Deduced a trap composed of 39 places in 366 ms of which 1 ms to minimize.
[2023-03-15 23:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2023-03-15 23:15:06] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-15 23:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 23:15:07] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:15:08] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:15:08] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2023-03-15 23:15:08] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-15 23:15:08] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:15:09] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:15:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2113 ms
[2023-03-15 23:15:09] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:15:10] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2023-03-15 23:15:10] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 0 ms to minimize.
[2023-03-15 23:15:11] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:15:11] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:15:11] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:15:12] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 0 ms to minimize.
[2023-03-15 23:15:12] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:15:12] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2023-03-15 23:15:13] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:15:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3565 ms
[2023-03-15 23:15:13] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 1 ms to minimize.
[2023-03-15 23:15:14] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:15:14] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 1 ms to minimize.
[2023-03-15 23:15:14] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 2 ms to minimize.
[2023-03-15 23:15:15] [INFO ] Deduced a trap composed of 52 places in 358 ms of which 1 ms to minimize.
[2023-03-15 23:15:15] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:15:16] [INFO ] Deduced a trap composed of 46 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:15:16] [INFO ] Deduced a trap composed of 46 places in 332 ms of which 0 ms to minimize.
[2023-03-15 23:15:16] [INFO ] Deduced a trap composed of 54 places in 345 ms of which 0 ms to minimize.
[2023-03-15 23:15:17] [INFO ] Deduced a trap composed of 60 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:15:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4058 ms
[2023-03-15 23:15:17] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:15:18] [INFO ] Deduced a trap composed of 44 places in 365 ms of which 1 ms to minimize.
[2023-03-15 23:15:20] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:15:20] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:15:21] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 1 ms to minimize.
[2023-03-15 23:15:21] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:15:22] [INFO ] Deduced a trap composed of 65 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:15:22] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2023-03-15 23:15:22] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 1 ms to minimize.
[2023-03-15 23:15:22] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 0 ms to minimize.
[2023-03-15 23:15:23] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:15:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5822 ms
[2023-03-15 23:15:24] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:15:24] [INFO ] Deduced a trap composed of 12 places in 403 ms of which 1 ms to minimize.
[2023-03-15 23:15:25] [INFO ] Deduced a trap composed of 10 places in 438 ms of which 1 ms to minimize.
[2023-03-15 23:15:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1304 ms
[2023-03-15 23:15:25] [INFO ] Deduced a trap composed of 18 places in 401 ms of which 1 ms to minimize.
[2023-03-15 23:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-15 23:15:26] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2023-03-15 23:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2023-03-15 23:15:27] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-15 23:15:28] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 1 ms to minimize.
[2023-03-15 23:15:29] [INFO ] Deduced a trap composed of 14 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:15:29] [INFO ] Deduced a trap composed of 54 places in 363 ms of which 1 ms to minimize.
[2023-03-15 23:15:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1370 ms
[2023-03-15 23:15:31] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:15:31] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:15:31] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 1 ms to minimize.
[2023-03-15 23:15:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1085 ms
[2023-03-15 23:15:32] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2023-03-15 23:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 23:15:33] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-15 23:15:34] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2023-03-15 23:15:35] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 1 ms to minimize.
[2023-03-15 23:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-15 23:15:36] [INFO ] Deduced a trap composed of 18 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-15 23:15:37] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 1 ms to minimize.
[2023-03-15 23:15:37] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 1 ms to minimize.
[2023-03-15 23:15:38] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:15:38] [INFO ] Deduced a trap composed of 55 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:15:39] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:15:39] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:15:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2863 ms
[2023-03-15 23:15:41] [INFO ] Deduced a trap composed of 45 places in 382 ms of which 1 ms to minimize.
[2023-03-15 23:15:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2023-03-15 23:15:41] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:15:41] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 0 ms to minimize.
[2023-03-15 23:15:42] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 0 ms to minimize.
[2023-03-15 23:15:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
[2023-03-15 23:15:43] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2023-03-15 23:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-15 23:15:47] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:15:47] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:15:48] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:15:48] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 1 ms to minimize.
[2023-03-15 23:15:48] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:15:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1325 ms
[2023-03-15 23:15:49] [INFO ] Deduced a trap composed of 19 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:15:49] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-15 23:15:49] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2023-03-15 23:15:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 842 ms
[2023-03-15 23:15:50] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
[2023-03-15 23:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2023-03-15 23:15:51] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-15 23:15:52] [INFO ] Deduced a trap composed of 53 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:15:52] [INFO ] Deduced a trap composed of 53 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:15:52] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:15:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 999 ms
[2023-03-15 23:15:53] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 1 ms to minimize.
[2023-03-15 23:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-15 23:15:54] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-15 23:15:55] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2023-03-15 23:15:55] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2023-03-15 23:15:56] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 1 ms to minimize.
[2023-03-15 23:15:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1679 ms
[2023-03-15 23:15:56] [INFO ] Deduced a trap composed of 52 places in 384 ms of which 1 ms to minimize.
[2023-03-15 23:15:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2023-03-15 23:15:57] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 0 ms to minimize.
[2023-03-15 23:15:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-15 23:15:57] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-15 23:15:58] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2023-03-15 23:15:58] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:15:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 649 ms
[2023-03-15 23:15:59] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 1 ms to minimize.
[2023-03-15 23:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2023-03-15 23:16:00] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 23:16:00] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 1 ms to minimize.
[2023-03-15 23:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 443 ms
[2023-03-15 23:16:03] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-15 23:16:03] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2023-03-15 23:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 23:16:04] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
[2023-03-15 23:16:05] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-15 23:16:06] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 1 ms to minimize.
[2023-03-15 23:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2023-03-15 23:16:08] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2023-03-15 23:16:09] [INFO ] Deduced a trap composed of 51 places in 332 ms of which 1 ms to minimize.
[2023-03-15 23:16:09] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2023-03-15 23:16:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 788 ms
[2023-03-15 23:16:10] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 1 ms to minimize.
[2023-03-15 23:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-15 23:16:13] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 0 ms to minimize.
[2023-03-15 23:16:14] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 1 ms to minimize.
[2023-03-15 23:16:14] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:16:15] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 0 ms to minimize.
[2023-03-15 23:16:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2208 ms
[2023-03-15 23:16:16] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-15 23:16:17] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 1 ms to minimize.
[2023-03-15 23:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-15 23:16:18] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2023-03-15 23:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 23:16:19] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:16:19] [INFO ] Deduced a trap composed of 18 places in 369 ms of which 1 ms to minimize.
[2023-03-15 23:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2023-03-15 23:16:20] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 0 ms to minimize.
[2023-03-15 23:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-15 23:16:21] [INFO ] Deduced a trap composed of 19 places in 368 ms of which 0 ms to minimize.
[2023-03-15 23:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1035 ms
[2023-03-15 23:16:23] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 1 ms to minimize.
[2023-03-15 23:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2023-03-15 23:16:24] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 0 ms to minimize.
[2023-03-15 23:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2023-03-15 23:16:24] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 0 ms to minimize.
[2023-03-15 23:16:25] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:16:25] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:16:26] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1705 ms
[2023-03-15 23:16:26] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-15 23:16:28] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 0 ms to minimize.
[2023-03-15 23:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 23:16:31] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-03-15 23:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-15 23:16:32] [INFO ] Deduced a trap composed of 63 places in 351 ms of which 5 ms to minimize.
[2023-03-15 23:16:33] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:16:33] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:16:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1235 ms
[2023-03-15 23:16:34] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-15 23:16:34] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 0 ms to minimize.
[2023-03-15 23:16:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 815 ms
[2023-03-15 23:16:35] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-15 23:16:38] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-15 23:16:42] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:16:42] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2023-03-15 23:16:43] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 0 ms to minimize.
[2023-03-15 23:16:43] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 0 ms to minimize.
[2023-03-15 23:16:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 744 ms
[2023-03-15 23:16:44] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2023-03-15 23:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 23:16:45] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 0 ms to minimize.
[2023-03-15 23:16:45] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2023-03-15 23:16:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-15 23:16:45] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:16:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 23:16:46] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:16:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-15 23:16:47] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:16:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 23:16:49] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2023-03-15 23:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-15 23:16:52] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 0 ms to minimize.
[2023-03-15 23:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 23:17:02] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2023-03-15 23:17:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-15 23:17:06] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-15 23:17:06] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:17:07] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:17:07] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:17:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 766 ms
[2023-03-15 23:17:07] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:17:07] [INFO ] Deduced a trap composed of 2 places in 322 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 23:17:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:17:07] [INFO ] After 225339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:367
Fused 367 Parikh solutions to 342 different solutions.
Parikh walk visited 0 properties in 4831 ms.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 32 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 467525 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Interrupted probabilistic random walk after 8828320 steps, run timeout after 102001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 8828320 steps, saw 1109013 distinct states, run finished after 102010 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 367 properties.
[2023-03-15 23:19:29] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:19:29] [INFO ] Invariant cache hit.
[2023-03-15 23:19:33] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 23:19:56] [INFO ] After 18230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:356
[2023-03-15 23:19:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:19:57] [INFO ] After 789ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:19:57] [INFO ] After 28559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:20:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 23:20:20] [INFO ] After 14085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2023-03-15 23:20:33] [INFO ] After 12260ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2023-03-15 23:20:33] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2023-03-15 23:20:33] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 0 ms to minimize.
[2023-03-15 23:20:33] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:20:34] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:20:34] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 0 ms to minimize.
[2023-03-15 23:20:34] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 1 ms to minimize.
[2023-03-15 23:20:35] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
[2023-03-15 23:20:35] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 0 ms to minimize.
[2023-03-15 23:20:35] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:20:36] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 1 ms to minimize.
[2023-03-15 23:20:36] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 0 ms to minimize.
[2023-03-15 23:20:36] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2023-03-15 23:20:37] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:20:37] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 12 ms to minimize.
[2023-03-15 23:20:37] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 0 ms to minimize.
[2023-03-15 23:20:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4748 ms
[2023-03-15 23:20:38] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 0 ms to minimize.
[2023-03-15 23:20:38] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 0 ms to minimize.
[2023-03-15 23:20:38] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:20:39] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:20:39] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:20:39] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:20:40] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:20:40] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 0 ms to minimize.
[2023-03-15 23:20:40] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:20:40] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:20:41] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:20:41] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-15 23:20:41] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:20:41] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:20:42] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:20:42] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:20:42] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 0 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 0 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 1 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 0 ms to minimize.
[2023-03-15 23:20:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5835 ms
[2023-03-15 23:20:44] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 1 ms to minimize.
[2023-03-15 23:20:44] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 0 ms to minimize.
[2023-03-15 23:20:44] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 0 ms to minimize.
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 0 ms to minimize.
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2582 ms
[2023-03-15 23:20:47] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:20:47] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:20:47] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2023-03-15 23:20:47] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:20:48] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:20:48] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:20:48] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:20:48] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 0 ms to minimize.
[2023-03-15 23:20:49] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:20:49] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 1 ms to minimize.
[2023-03-15 23:20:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2481 ms
[2023-03-15 23:20:49] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:20:49] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2023-03-15 23:20:50] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:20:50] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:20:50] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 0 ms to minimize.
[2023-03-15 23:20:50] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:20:51] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2023-03-15 23:20:51] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:20:51] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 0 ms to minimize.
[2023-03-15 23:20:51] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:20:52] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2023-03-15 23:20:52] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 1 ms to minimize.
[2023-03-15 23:20:52] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:20:52] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:20:53] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 0 ms to minimize.
[2023-03-15 23:20:53] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 1 ms to minimize.
[2023-03-15 23:20:53] [INFO ] Deduced a trap composed of 73 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:20:53] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 0 ms to minimize.
[2023-03-15 23:20:54] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:20:54] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 0 ms to minimize.
[2023-03-15 23:20:54] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:20:54] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5435 ms
[2023-03-15 23:20:55] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2023-03-15 23:20:55] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:20:55] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:20:56] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:20:56] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:20:56] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:20:56] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 1 ms to minimize.
[2023-03-15 23:20:57] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:20:57] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 1 ms to minimize.
[2023-03-15 23:20:57] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 1 ms to minimize.
[2023-03-15 23:20:57] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 1 ms to minimize.
[2023-03-15 23:20:57] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:20:58] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 1 ms to minimize.
[2023-03-15 23:20:58] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 0 ms to minimize.
[2023-03-15 23:20:58] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:20:58] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 0 ms to minimize.
[2023-03-15 23:20:59] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 1 ms to minimize.
[2023-03-15 23:20:59] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4115 ms
[2023-03-15 23:20:59] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 2 ms to minimize.
[2023-03-15 23:21:00] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 1 ms to minimize.
[2023-03-15 23:21:00] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 0 ms to minimize.
[2023-03-15 23:21:00] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2023-03-15 23:21:01] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:21:01] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:21:01] [INFO ] Deduced a trap composed of 67 places in 279 ms of which 0 ms to minimize.
[2023-03-15 23:21:02] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 0 ms to minimize.
[2023-03-15 23:21:02] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 0 ms to minimize.
[2023-03-15 23:21:02] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:21:03] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 1 ms to minimize.
[2023-03-15 23:21:03] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:21:03] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:21:04] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:21:04] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 0 ms to minimize.
[2023-03-15 23:21:04] [INFO ] Deduced a trap composed of 14 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:21:05] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:21:05] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 0 ms to minimize.
[2023-03-15 23:21:05] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:21:06] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 1 ms to minimize.
[2023-03-15 23:21:06] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2023-03-15 23:21:06] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 0 ms to minimize.
[2023-03-15 23:21:07] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:21:07] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 0 ms to minimize.
[2023-03-15 23:21:07] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 1 ms to minimize.
[2023-03-15 23:21:07] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8691 ms
[2023-03-15 23:21:08] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 0 ms to minimize.
[2023-03-15 23:21:08] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 0 ms to minimize.
[2023-03-15 23:21:08] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 0 ms to minimize.
[2023-03-15 23:21:09] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 0 ms to minimize.
[2023-03-15 23:21:09] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:21:09] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:21:10] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 1 ms to minimize.
[2023-03-15 23:21:10] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:21:10] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:21:11] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 1 ms to minimize.
[2023-03-15 23:21:11] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:21:11] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:21:11] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2023-03-15 23:21:12] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:21:12] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 0 ms to minimize.
[2023-03-15 23:21:12] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:21:12] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:21:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4852 ms
[2023-03-15 23:21:13] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 0 ms to minimize.
[2023-03-15 23:21:13] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 1 ms to minimize.
[2023-03-15 23:21:13] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 0 ms to minimize.
[2023-03-15 23:21:14] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 0 ms to minimize.
[2023-03-15 23:21:14] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-15 23:21:14] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 1 ms to minimize.
[2023-03-15 23:21:14] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 0 ms to minimize.
[2023-03-15 23:21:14] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2023-03-15 23:21:15] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:21:15] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:21:15] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 0 ms to minimize.
[2023-03-15 23:21:16] [INFO ] Deduced a trap composed of 35 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:21:16] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 1 ms to minimize.
[2023-03-15 23:21:17] [INFO ] Deduced a trap composed of 11 places in 408 ms of which 1 ms to minimize.
[2023-03-15 23:21:17] [INFO ] Deduced a trap composed of 39 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:21:17] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:21:18] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:21:18] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:21:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5591 ms
[2023-03-15 23:21:18] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 1 ms to minimize.
[2023-03-15 23:21:19] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 1 ms to minimize.
[2023-03-15 23:21:19] [INFO ] Deduced a trap composed of 59 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:21:19] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:21:20] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 0 ms to minimize.
[2023-03-15 23:21:20] [INFO ] Deduced a trap composed of 59 places in 275 ms of which 0 ms to minimize.
[2023-03-15 23:21:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1740 ms
[2023-03-15 23:21:21] [INFO ] Deduced a trap composed of 19 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:21:21] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 1 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 29 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 0 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 0 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3694 ms
[2023-03-15 23:21:25] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:21:25] [INFO ] Deduced a trap composed of 59 places in 293 ms of which 1 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 50 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 0 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 1 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:21:27] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2023-03-15 23:21:27] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:21:27] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:21:27] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 0 ms to minimize.
[2023-03-15 23:21:28] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2023-03-15 23:21:28] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2023-03-15 23:21:28] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-15 23:21:28] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 0 ms to minimize.
[2023-03-15 23:21:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3799 ms
[2023-03-15 23:21:28] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 0 ms to minimize.
[2023-03-15 23:21:29] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:21:29] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2023-03-15 23:21:29] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 0 ms to minimize.
[2023-03-15 23:21:30] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 1 ms to minimize.
[2023-03-15 23:21:30] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:21:30] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 0 ms to minimize.
[2023-03-15 23:21:30] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:21:31] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:21:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2379 ms
[2023-03-15 23:21:31] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 0 ms to minimize.
[2023-03-15 23:21:31] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1408 ms
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 614 ms
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 848 ms
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 1 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-15 23:21:35] [INFO ] Deduced a trap composed of 59 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:21:35] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2023-03-15 23:21:36] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 0 ms to minimize.
[2023-03-15 23:21:36] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:21:36] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 1 ms to minimize.
[2023-03-15 23:21:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1553 ms
[2023-03-15 23:21:36] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 0 ms to minimize.
[2023-03-15 23:21:37] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:21:37] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2023-03-15 23:21:37] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 0 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1741 ms
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:21:39] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:21:39] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:21:39] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 1 ms to minimize.
[2023-03-15 23:21:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1280 ms
[2023-03-15 23:21:40] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:21:40] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 0 ms to minimize.
[2023-03-15 23:21:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-15 23:21:41] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 1 ms to minimize.
[2023-03-15 23:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2023-03-15 23:21:41] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 1 ms to minimize.
[2023-03-15 23:21:41] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 1 ms to minimize.
[2023-03-15 23:21:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2023-03-15 23:21:42] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-15 23:21:42] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-15 23:21:43] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 23:21:43] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-15 23:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-15 23:21:44] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:21:44] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 1 ms to minimize.
[2023-03-15 23:21:44] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:21:44] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2023-03-15 23:21:45] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:21:45] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:21:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1587 ms
[2023-03-15 23:21:45] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-15 23:21:45] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:21:46] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2023-03-15 23:21:46] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 0 ms to minimize.
[2023-03-15 23:21:46] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:21:47] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 0 ms to minimize.
[2023-03-15 23:21:47] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:21:47] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:21:47] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 0 ms to minimize.
[2023-03-15 23:21:48] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 0 ms to minimize.
[2023-03-15 23:21:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2727 ms
[2023-03-15 23:21:48] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 0 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 0 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 0 ms to minimize.
[2023-03-15 23:21:50] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 0 ms to minimize.
[2023-03-15 23:21:50] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:21:50] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2668 ms
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 0 ms to minimize.
[2023-03-15 23:21:53] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 0 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 1 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4604 ms
[2023-03-15 23:21:56] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:21:56] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 0 ms to minimize.
[2023-03-15 23:21:57] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:21:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 860 ms
[2023-03-15 23:21:57] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 0 ms to minimize.
[2023-03-15 23:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2023-03-15 23:21:58] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 0 ms to minimize.
[2023-03-15 23:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-15 23:21:59] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 0 ms to minimize.
[2023-03-15 23:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 23:22:00] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:22:00] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:22:00] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 0 ms to minimize.
[2023-03-15 23:22:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 812 ms
[2023-03-15 23:22:01] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:22:01] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 1 ms to minimize.
[2023-03-15 23:22:02] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:22:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2023-03-15 23:22:02] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2023-03-15 23:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 23:22:03] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 23:22:04] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 0 ms to minimize.
[2023-03-15 23:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 23:22:05] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 0 ms to minimize.
[2023-03-15 23:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2023-03-15 23:22:05] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 0 ms to minimize.
[2023-03-15 23:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-15 23:22:06] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2023-03-15 23:22:06] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 0 ms to minimize.
[2023-03-15 23:22:06] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:22:07] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 1 ms to minimize.
[2023-03-15 23:22:08] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2023-03-15 23:22:08] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2023-03-15 23:22:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2239 ms
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 1 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 0 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2023-03-15 23:22:10] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-15 23:22:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-15 23:22:14] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-15 23:22:15] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:22:15] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 0 ms to minimize.
[2023-03-15 23:22:15] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2023-03-15 23:22:15] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 0 ms to minimize.
[2023-03-15 23:22:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1074 ms
[2023-03-15 23:22:16] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 0 ms to minimize.
[2023-03-15 23:22:16] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:22:16] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2023-03-15 23:22:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 679 ms
[2023-03-15 23:22:17] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 0 ms to minimize.
[2023-03-15 23:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-15 23:22:18] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 23:22:18] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2023-03-15 23:22:18] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 1 ms to minimize.
[2023-03-15 23:22:19] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2023-03-15 23:22:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 656 ms
[2023-03-15 23:22:19] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-15 23:22:20] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:22:20] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2023-03-15 23:22:21] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:22:21] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:22:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1091 ms
[2023-03-15 23:22:21] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 0 ms to minimize.
[2023-03-15 23:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-15 23:22:22] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 0 ms to minimize.
[2023-03-15 23:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 23:22:22] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-15 23:22:22] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-15 23:22:22] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-15 23:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2023-03-15 23:22:23] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2023-03-15 23:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-15 23:22:24] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-15 23:22:25] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-15 23:22:26] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 23:22:27] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2023-03-15 23:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-15 23:22:27] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-15 23:22:29] [INFO ] Deduced a trap composed of 34 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2023-03-15 23:22:30] [INFO ] Deduced a trap composed of 45 places in 382 ms of which 0 ms to minimize.
[2023-03-15 23:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-15 23:22:31] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 1 ms to minimize.
[2023-03-15 23:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2023-03-15 23:22:32] [INFO ] Deduced a trap composed of 51 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:22:33] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 752 ms
[2023-03-15 23:22:33] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 0 ms to minimize.
[2023-03-15 23:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-15 23:22:37] [INFO ] Deduced a trap composed of 78 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:22:37] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 1 ms to minimize.
[2023-03-15 23:22:38] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 1 ms to minimize.
[2023-03-15 23:22:39] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 0 ms to minimize.
[2023-03-15 23:22:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2365 ms
[2023-03-15 23:22:40] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-15 23:22:40] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 0 ms to minimize.
[2023-03-15 23:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2023-03-15 23:22:41] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 0 ms to minimize.
[2023-03-15 23:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 23:22:42] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:22:42] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 1 ms to minimize.
[2023-03-15 23:22:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-15 23:22:43] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-15 23:22:44] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 0 ms to minimize.
[2023-03-15 23:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 958 ms
[2023-03-15 23:22:46] [INFO ] Deduced a trap composed of 18 places in 394 ms of which 1 ms to minimize.
[2023-03-15 23:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2023-03-15 23:22:47] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2023-03-15 23:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2023-03-15 23:22:48] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 1 ms to minimize.
[2023-03-15 23:22:48] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 1 ms to minimize.
[2023-03-15 23:22:48] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 1 ms to minimize.
[2023-03-15 23:22:49] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2023-03-15 23:22:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1576 ms
[2023-03-15 23:22:49] [INFO ] Deduced a trap composed of 68 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-15 23:22:51] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 0 ms to minimize.
[2023-03-15 23:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-15 23:22:55] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:22:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-15 23:22:56] [INFO ] Deduced a trap composed of 63 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:22:56] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 1 ms to minimize.
[2023-03-15 23:22:57] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 0 ms to minimize.
[2023-03-15 23:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1296 ms
[2023-03-15 23:22:58] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:22:58] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 0 ms to minimize.
[2023-03-15 23:22:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 983 ms
[2023-03-15 23:22:59] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 1 ms to minimize.
[2023-03-15 23:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-15 23:23:02] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-15 23:23:08] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:23:08] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:23:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 868 ms
[2023-03-15 23:23:09] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 1 ms to minimize.
[2023-03-15 23:23:09] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:23:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1285 ms
[2023-03-15 23:23:10] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-15 23:23:12] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:23:12] [INFO ] Deduced a trap composed of 36 places in 373 ms of which 1 ms to minimize.
[2023-03-15 23:23:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 916 ms
[2023-03-15 23:23:13] [INFO ] Deduced a trap composed of 58 places in 384 ms of which 1 ms to minimize.
[2023-03-15 23:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-15 23:23:14] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 0 ms to minimize.
[2023-03-15 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2023-03-15 23:23:16] [INFO ] Deduced a trap composed of 47 places in 345 ms of which 1 ms to minimize.
[2023-03-15 23:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-15 23:23:18] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 23:23:22] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 0 ms to minimize.
[2023-03-15 23:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 23:23:36] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 1 ms to minimize.
[2023-03-15 23:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-15 23:23:42] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 1 ms to minimize.
[2023-03-15 23:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-15 23:23:42] [INFO ] Deduced a trap composed of 56 places in 303 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-15 23:23:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:23:42] [INFO ] After 225089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:367
Fused 367 Parikh solutions to 342 different solutions.
Parikh walk visited 0 properties in 4741 ms.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 44 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:23:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:23:47] [INFO ] Invariant cache hit.
[2023-03-15 23:23:47] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-15 23:23:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:23:47] [INFO ] Invariant cache hit.
[2023-03-15 23:23:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:23:49] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-15 23:23:49] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-15 23:23:49] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:23:49] [INFO ] Invariant cache hit.
[2023-03-15 23:23:51] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3461 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4940 ms. (steps per millisecond=20 ) properties (out of 268) seen :95
Running SMT prover for 173 properties.
[2023-03-15 23:23:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:23:56] [INFO ] Invariant cache hit.
[2023-03-15 23:23:56] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 23:23:57] [INFO ] After 681ms SMT Verify possible using state equation in real domain returned unsat :0 sat :173
[2023-03-15 23:23:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:23:57] [INFO ] After 940ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :173
[2023-03-15 23:23:58] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2023-03-15 23:23:58] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:23:59] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 1 ms to minimize.
[2023-03-15 23:23:59] [INFO ] Deduced a trap composed of 63 places in 407 ms of which 1 ms to minimize.
[2023-03-15 23:24:00] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 1 ms to minimize.
[2023-03-15 23:24:00] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 45 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 48 places in 396 ms of which 1 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 53 places in 345 ms of which 1 ms to minimize.
[2023-03-15 23:24:02] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:24:02] [INFO ] Deduced a trap composed of 78 places in 302 ms of which 1 ms to minimize.
[2023-03-15 23:24:02] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 1 ms to minimize.
[2023-03-15 23:24:03] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 1 ms to minimize.
[2023-03-15 23:24:03] [INFO ] Deduced a trap composed of 85 places in 307 ms of which 1 ms to minimize.
[2023-03-15 23:24:03] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2023-03-15 23:24:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5776 ms
[2023-03-15 23:24:04] [INFO ] Deduced a trap composed of 77 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-15 23:24:04] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 1 ms to minimize.
[2023-03-15 23:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-15 23:24:04] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-03-15 23:24:05] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:24:05] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2023-03-15 23:24:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2023-03-15 23:24:05] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 23:24:06] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-15 23:24:06] [INFO ] Deduced a trap composed of 78 places in 371 ms of which 1 ms to minimize.
[2023-03-15 23:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2023-03-15 23:24:07] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:24:07] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 0 ms to minimize.
[2023-03-15 23:24:08] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 0 ms to minimize.
[2023-03-15 23:24:08] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 0 ms to minimize.
[2023-03-15 23:24:08] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:24:08] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:24:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1809 ms
[2023-03-15 23:24:09] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 1 ms to minimize.
[2023-03-15 23:24:09] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:24:10] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:24:10] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:24:10] [INFO ] Deduced a trap composed of 70 places in 253 ms of which 1 ms to minimize.
[2023-03-15 23:24:10] [INFO ] Deduced a trap composed of 90 places in 274 ms of which 0 ms to minimize.
[2023-03-15 23:24:11] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 1 ms to minimize.
[2023-03-15 23:24:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2125 ms
[2023-03-15 23:24:11] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:24:11] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:24:11] [INFO ] Deduced a trap composed of 81 places in 204 ms of which 1 ms to minimize.
[2023-03-15 23:24:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 725 ms
[2023-03-15 23:24:12] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 0 ms to minimize.
[2023-03-15 23:24:12] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 1 ms to minimize.
[2023-03-15 23:24:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-15 23:24:13] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 1 ms to minimize.
[2023-03-15 23:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-15 23:24:15] [INFO ] Deduced a trap composed of 69 places in 318 ms of which 1 ms to minimize.
[2023-03-15 23:24:15] [INFO ] Deduced a trap composed of 46 places in 331 ms of which 1 ms to minimize.
[2023-03-15 23:24:15] [INFO ] Deduced a trap composed of 63 places in 318 ms of which 1 ms to minimize.
[2023-03-15 23:24:16] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 1 ms to minimize.
[2023-03-15 23:24:16] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 0 ms to minimize.
[2023-03-15 23:24:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1898 ms
[2023-03-15 23:24:17] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-15 23:24:17] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2023-03-15 23:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-15 23:24:17] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 23:24:18] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2023-03-15 23:24:18] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 0 ms to minimize.
[2023-03-15 23:24:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2023-03-15 23:24:19] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2023-03-15 23:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-15 23:24:19] [INFO ] Deduced a trap composed of 47 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:24:20] [INFO ] Deduced a trap composed of 77 places in 384 ms of which 1 ms to minimize.
[2023-03-15 23:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 926 ms
[2023-03-15 23:24:21] [INFO ] Deduced a trap composed of 71 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:24:21] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:24:22] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 1 ms to minimize.
[2023-03-15 23:24:22] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:24:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1541 ms
[2023-03-15 23:24:23] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:24:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-15 23:24:27] [INFO ] Deduced a trap composed of 68 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:24:27] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 1 ms to minimize.
[2023-03-15 23:24:28] [INFO ] Deduced a trap composed of 93 places in 332 ms of which 1 ms to minimize.
[2023-03-15 23:24:28] [INFO ] Deduced a trap composed of 93 places in 373 ms of which 1 ms to minimize.
[2023-03-15 23:24:29] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:24:29] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 1 ms to minimize.
[2023-03-15 23:24:29] [INFO ] Deduced a trap composed of 98 places in 355 ms of which 1 ms to minimize.
[2023-03-15 23:24:30] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 1 ms to minimize.
[2023-03-15 23:24:30] [INFO ] Deduced a trap composed of 86 places in 339 ms of which 1 ms to minimize.
[2023-03-15 23:24:31] [INFO ] Deduced a trap composed of 86 places in 346 ms of which 1 ms to minimize.
[2023-03-15 23:24:31] [INFO ] Deduced a trap composed of 86 places in 343 ms of which 0 ms to minimize.
[2023-03-15 23:24:32] [INFO ] Deduced a trap composed of 69 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:24:32] [INFO ] Deduced a trap composed of 73 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:24:32] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:24:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5700 ms
[2023-03-15 23:24:32] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2023-03-15 23:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-15 23:24:33] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 0 ms to minimize.
[2023-03-15 23:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 23:24:34] [INFO ] Deduced a trap composed of 63 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:24:35] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:24:35] [INFO ] Deduced a trap composed of 60 places in 378 ms of which 1 ms to minimize.
[2023-03-15 23:24:35] [INFO ] Deduced a trap composed of 68 places in 373 ms of which 0 ms to minimize.
[2023-03-15 23:24:36] [INFO ] Deduced a trap composed of 68 places in 361 ms of which 1 ms to minimize.
[2023-03-15 23:24:36] [INFO ] Deduced a trap composed of 68 places in 365 ms of which 1 ms to minimize.
[2023-03-15 23:24:37] [INFO ] Deduced a trap composed of 81 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:24:37] [INFO ] Deduced a trap composed of 88 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:24:38] [INFO ] Deduced a trap composed of 67 places in 343 ms of which 1 ms to minimize.
[2023-03-15 23:24:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3908 ms
[2023-03-15 23:24:38] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 1 ms to minimize.
[2023-03-15 23:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 23:24:40] [INFO ] Deduced a trap composed of 76 places in 369 ms of which 1 ms to minimize.
[2023-03-15 23:24:40] [INFO ] Deduced a trap composed of 72 places in 380 ms of which 0 ms to minimize.
[2023-03-15 23:24:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 940 ms
[2023-03-15 23:24:41] [INFO ] Deduced a trap composed of 68 places in 356 ms of which 1 ms to minimize.
[2023-03-15 23:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-15 23:24:43] [INFO ] Deduced a trap composed of 81 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:24:43] [INFO ] Deduced a trap composed of 76 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 806 ms
[2023-03-15 23:24:46] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-15 23:24:47] [INFO ] After 50064ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:173
[2023-03-15 23:24:47] [INFO ] After 51021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:173
[2023-03-15 23:24:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 23:24:48] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :173
[2023-03-15 23:24:49] [INFO ] After 990ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :173
[2023-03-15 23:24:49] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 0 ms to minimize.
[2023-03-15 23:24:50] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 1 ms to minimize.
[2023-03-15 23:24:50] [INFO ] Deduced a trap composed of 56 places in 428 ms of which 1 ms to minimize.
[2023-03-15 23:24:51] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 1 ms to minimize.
[2023-03-15 23:24:51] [INFO ] Deduced a trap composed of 51 places in 411 ms of which 1 ms to minimize.
[2023-03-15 23:24:52] [INFO ] Deduced a trap composed of 15 places in 434 ms of which 1 ms to minimize.
[2023-03-15 23:24:52] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 1 ms to minimize.
[2023-03-15 23:24:53] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 1 ms to minimize.
[2023-03-15 23:24:53] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 1 ms to minimize.
[2023-03-15 23:24:54] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 1 ms to minimize.
[2023-03-15 23:24:54] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 1 ms to minimize.
[2023-03-15 23:24:55] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2023-03-15 23:24:55] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 1 ms to minimize.
[2023-03-15 23:24:55] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 1 ms to minimize.
[2023-03-15 23:24:56] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:24:56] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 1 ms to minimize.
[2023-03-15 23:24:57] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:24:57] [INFO ] Deduced a trap composed of 31 places in 410 ms of which 1 ms to minimize.
[2023-03-15 23:24:58] [INFO ] Deduced a trap composed of 44 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:24:58] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2023-03-15 23:24:58] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:24:59] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 1 ms to minimize.
[2023-03-15 23:24:59] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 1 ms to minimize.
[2023-03-15 23:25:00] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:25:00] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:25:01] [INFO ] Deduced a trap composed of 45 places in 410 ms of which 0 ms to minimize.
[2023-03-15 23:25:01] [INFO ] Deduced a trap composed of 36 places in 403 ms of which 1 ms to minimize.
[2023-03-15 23:25:02] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:25:02] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 1 ms to minimize.
[2023-03-15 23:25:02] [INFO ] Deduced a trap composed of 30 places in 343 ms of which 0 ms to minimize.
[2023-03-15 23:25:03] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 0 ms to minimize.
[2023-03-15 23:25:03] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 1 ms to minimize.
[2023-03-15 23:25:03] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 14148 ms
[2023-03-15 23:25:04] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:25:04] [INFO ] Deduced a trap composed of 20 places in 325 ms of which 0 ms to minimize.
[2023-03-15 23:25:04] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 1 ms to minimize.
[2023-03-15 23:25:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1188 ms
[2023-03-15 23:25:05] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:25:05] [INFO ] Deduced a trap composed of 85 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:25:06] [INFO ] Deduced a trap composed of 67 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:25:06] [INFO ] Deduced a trap composed of 83 places in 336 ms of which 0 ms to minimize.
[2023-03-15 23:25:07] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:25:07] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:25:07] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:25:08] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:25:08] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 1 ms to minimize.
[2023-03-15 23:25:09] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:25:09] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 0 ms to minimize.
[2023-03-15 23:25:09] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2023-03-15 23:25:10] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:25:10] [INFO ] Deduced a trap composed of 77 places in 322 ms of which 0 ms to minimize.
[2023-03-15 23:25:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5558 ms
[2023-03-15 23:25:11] [INFO ] Deduced a trap composed of 46 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:25:11] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 1 ms to minimize.
[2023-03-15 23:25:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 846 ms
[2023-03-15 23:25:12] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2023-03-15 23:25:12] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 0 ms to minimize.
[2023-03-15 23:25:12] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:25:13] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:25:13] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:25:13] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:25:14] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 1 ms to minimize.
[2023-03-15 23:25:14] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 1 ms to minimize.
[2023-03-15 23:25:14] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-15 23:25:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2899 ms
[2023-03-15 23:25:15] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:25:15] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:25:16] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 0 ms to minimize.
[2023-03-15 23:25:16] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:25:16] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:25:16] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:25:17] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 0 ms to minimize.
[2023-03-15 23:25:17] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:25:17] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:25:17] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:25:18] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:25:18] [INFO ] Deduced a trap composed of 18 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:25:19] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:25:19] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:25:19] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 1 ms to minimize.
[2023-03-15 23:25:20] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:25:20] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:25:20] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:25:20] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:25:21] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:25:21] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:25:21] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:25:21] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:25:22] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 0 ms to minimize.
[2023-03-15 23:25:23] [INFO ] Deduced a trap composed of 56 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:25:23] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 1 ms to minimize.
[2023-03-15 23:25:23] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:25:24] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-15 23:25:24] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:25:25] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2023-03-15 23:25:25] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:25:25] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:25:26] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 1 ms to minimize.
[2023-03-15 23:25:26] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:25:26] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:25:27] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 1 ms to minimize.
[2023-03-15 23:25:27] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:25:27] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12458 ms
[2023-03-15 23:25:27] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:25:28] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 1 ms to minimize.
[2023-03-15 23:25:28] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2023-03-15 23:25:28] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2023-03-15 23:25:29] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:25:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1429 ms
[2023-03-15 23:25:29] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-15 23:25:30] [INFO ] Deduced a trap composed of 73 places in 238 ms of which 0 ms to minimize.
[2023-03-15 23:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-15 23:25:30] [INFO ] Deduced a trap composed of 87 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:25:31] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2023-03-15 23:25:31] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:25:31] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 0 ms to minimize.
[2023-03-15 23:25:31] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 0 ms to minimize.
[2023-03-15 23:25:31] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2023-03-15 23:25:32] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:25:32] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:25:32] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:25:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2124 ms
[2023-03-15 23:25:32] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-15 23:25:33] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 0 ms to minimize.
[2023-03-15 23:25:33] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 0 ms to minimize.
[2023-03-15 23:25:34] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2023-03-15 23:25:34] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 0 ms to minimize.
[2023-03-15 23:25:34] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 1 ms to minimize.
[2023-03-15 23:25:34] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 0 ms to minimize.
[2023-03-15 23:25:35] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:25:35] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 1 ms to minimize.
[2023-03-15 23:25:35] [INFO ] Deduced a trap composed of 24 places in 380 ms of which 1 ms to minimize.
[2023-03-15 23:25:36] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:25:36] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2023-03-15 23:25:36] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:25:37] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:25:37] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:25:37] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 0 ms to minimize.
[2023-03-15 23:25:37] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-15 23:25:37] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 0 ms to minimize.
[2023-03-15 23:25:38] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:25:38] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 1 ms to minimize.
[2023-03-15 23:25:38] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 0 ms to minimize.
[2023-03-15 23:25:38] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 1 ms to minimize.
[2023-03-15 23:25:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5641 ms
[2023-03-15 23:25:39] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2023-03-15 23:25:39] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:25:39] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 0 ms to minimize.
[2023-03-15 23:25:39] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 1 ms to minimize.
[2023-03-15 23:25:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 998 ms
[2023-03-15 23:25:40] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:25:40] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 0 ms to minimize.
[2023-03-15 23:25:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2023-03-15 23:25:40] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 0 ms to minimize.
[2023-03-15 23:25:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-15 23:25:41] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-15 23:25:41] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:25:41] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 0 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 0 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2023-03-15 23:25:42] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:25:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2041 ms
[2023-03-15 23:25:43] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-15 23:25:43] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 0 ms to minimize.
[2023-03-15 23:25:43] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-03-15 23:25:43] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2023-03-15 23:25:43] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 0 ms to minimize.
[2023-03-15 23:25:44] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-15 23:25:44] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2023-03-15 23:25:44] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:25:44] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:25:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1664 ms
[2023-03-15 23:25:44] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 0 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2023-03-15 23:25:45] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 1 ms to minimize.
[2023-03-15 23:25:46] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 1 ms to minimize.
[2023-03-15 23:25:46] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 0 ms to minimize.
[2023-03-15 23:25:46] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2023-03-15 23:25:46] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:25:46] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:25:47] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:25:47] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:25:47] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 0 ms to minimize.
[2023-03-15 23:25:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2883 ms
[2023-03-15 23:25:47] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2023-03-15 23:25:48] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 0 ms to minimize.
[2023-03-15 23:25:48] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-15 23:25:48] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2023-03-15 23:25:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2023-03-15 23:25:48] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 1 ms to minimize.
[2023-03-15 23:25:49] [INFO ] Deduced a trap composed of 70 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:25:49] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 1 ms to minimize.
[2023-03-15 23:25:49] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 0 ms to minimize.
[2023-03-15 23:25:50] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 0 ms to minimize.
[2023-03-15 23:25:50] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 0 ms to minimize.
[2023-03-15 23:25:50] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:25:50] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:25:51] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:25:51] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:25:51] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:25:52] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 1 ms to minimize.
[2023-03-15 23:25:52] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:25:52] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:25:52] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:25:53] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:25:53] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:25:53] [INFO ] Deduced a trap composed of 69 places in 220 ms of which 1 ms to minimize.
[2023-03-15 23:25:53] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:25:54] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2023-03-15 23:25:54] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-15 23:25:54] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 0 ms to minimize.
[2023-03-15 23:25:54] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 1 ms to minimize.
[2023-03-15 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6320 ms
[2023-03-15 23:25:55] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-15 23:25:55] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-15 23:25:55] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 0 ms to minimize.
[2023-03-15 23:25:56] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 0 ms to minimize.
[2023-03-15 23:25:56] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:25:56] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2023-03-15 23:25:56] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:25:57] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:25:57] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2023-03-15 23:25:57] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 0 ms to minimize.
[2023-03-15 23:25:58] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 0 ms to minimize.
[2023-03-15 23:25:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3141 ms
[2023-03-15 23:25:58] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 0 ms to minimize.
[2023-03-15 23:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-15 23:25:59] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 0 ms to minimize.
[2023-03-15 23:25:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 23:25:59] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:26:00] [INFO ] Deduced a trap composed of 84 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:26:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 678 ms
[2023-03-15 23:26:00] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 0 ms to minimize.
[2023-03-15 23:26:01] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:26:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2023-03-15 23:26:02] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 0 ms to minimize.
[2023-03-15 23:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 23:26:02] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 0 ms to minimize.
[2023-03-15 23:26:02] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2023-03-15 23:26:03] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:26:03] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:26:03] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
[2023-03-15 23:26:03] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 0 ms to minimize.
[2023-03-15 23:26:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1419 ms
[2023-03-15 23:26:04] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:26:04] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 0 ms to minimize.
[2023-03-15 23:26:05] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 1 ms to minimize.
[2023-03-15 23:26:05] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:26:05] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:26:05] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 0 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 0 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:26:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3094 ms
[2023-03-15 23:26:07] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-15 23:26:08] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:26:08] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2023-03-15 23:26:09] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 1 ms to minimize.
[2023-03-15 23:26:09] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:26:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1282 ms
[2023-03-15 23:26:09] [INFO ] Deduced a trap composed of 30 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:26:10] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:26:10] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:26:10] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:26:11] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 0 ms to minimize.
[2023-03-15 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2002 ms
[2023-03-15 23:26:12] [INFO ] Deduced a trap composed of 44 places in 406 ms of which 1 ms to minimize.
[2023-03-15 23:26:12] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 1 ms to minimize.
[2023-03-15 23:26:12] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-15 23:26:12] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 0 ms to minimize.
[2023-03-15 23:26:13] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 0 ms to minimize.
[2023-03-15 23:26:13] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:26:14] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:26:14] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:26:14] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:26:14] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 0 ms to minimize.
[2023-03-15 23:26:15] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 0 ms to minimize.
[2023-03-15 23:26:15] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 0 ms to minimize.
[2023-03-15 23:26:15] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 1 ms to minimize.
[2023-03-15 23:26:16] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:26:16] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 1 ms to minimize.
[2023-03-15 23:26:16] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 0 ms to minimize.
[2023-03-15 23:26:16] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:26:17] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 0 ms to minimize.
[2023-03-15 23:26:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5595 ms
[2023-03-15 23:26:17] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:26:17] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 1 ms to minimize.
[2023-03-15 23:26:18] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2023-03-15 23:26:18] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:26:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1605 ms
[2023-03-15 23:26:19] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 1 ms to minimize.
[2023-03-15 23:26:19] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 0 ms to minimize.
[2023-03-15 23:26:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 732 ms
[2023-03-15 23:26:20] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 0 ms to minimize.
[2023-03-15 23:26:20] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:26:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2023-03-15 23:26:20] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-15 23:26:21] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2023-03-15 23:26:21] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:26:21] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:26:22] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:26:22] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:26:22] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:26:22] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 1 ms to minimize.
[2023-03-15 23:26:23] [INFO ] Deduced a trap composed of 55 places in 291 ms of which 0 ms to minimize.
[2023-03-15 23:26:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2692 ms
[2023-03-15 23:26:23] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-03-15 23:26:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-15 23:26:23] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2023-03-15 23:26:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 23:26:24] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 0 ms to minimize.
[2023-03-15 23:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-15 23:26:24] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 1 ms to minimize.
[2023-03-15 23:26:25] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 0 ms to minimize.
[2023-03-15 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2023-03-15 23:26:25] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 0 ms to minimize.
[2023-03-15 23:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2023-03-15 23:26:26] [INFO ] Deduced a trap composed of 52 places in 286 ms of which 1 ms to minimize.
[2023-03-15 23:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-15 23:26:26] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:26:26] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 0 ms to minimize.
[2023-03-15 23:26:27] [INFO ] Deduced a trap composed of 30 places in 319 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
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-15 23:26:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:26:27] [INFO ] After 100171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:173
Interrupted random walk after 467597 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 367) seen :0
Interrupted probabilistic random walk after 8831120 steps, run timeout after 102001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 8831120 steps, saw 1110495 distinct states, run finished after 102001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 367 properties.
[2023-03-15 23:28:43] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:28:43] [INFO ] Invariant cache hit.
[2023-03-15 23:28:48] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 23:29:09] [INFO ] After 16475ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:356
[2023-03-15 23:29:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:29:10] [INFO ] After 489ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:29:10] [INFO ] After 26746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 23:29:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 23:29:26] [INFO ] After 10140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2023-03-15 23:29:38] [INFO ] After 11717ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2023-03-15 23:29:38] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 0 ms to minimize.
[2023-03-15 23:29:38] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:29:39] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:29:39] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:29:39] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:29:40] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 1 ms to minimize.
[2023-03-15 23:29:40] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 0 ms to minimize.
[2023-03-15 23:29:40] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 0 ms to minimize.
[2023-03-15 23:29:41] [INFO ] Deduced a trap composed of 72 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:29:41] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:29:41] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:29:41] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:29:42] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 0 ms to minimize.
[2023-03-15 23:29:42] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 0 ms to minimize.
[2023-03-15 23:29:42] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:29:42] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4507 ms
[2023-03-15 23:29:43] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 0 ms to minimize.
[2023-03-15 23:29:43] [INFO ] Deduced a trap composed of 45 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:29:44] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2023-03-15 23:29:44] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 0 ms to minimize.
[2023-03-15 23:29:44] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:29:44] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:29:45] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 1 ms to minimize.
[2023-03-15 23:29:45] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:29:45] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 0 ms to minimize.
[2023-03-15 23:29:46] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:29:46] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:29:46] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:29:46] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 0 ms to minimize.
[2023-03-15 23:29:47] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:29:47] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:29:47] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:29:47] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:29:48] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:29:48] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:29:48] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:29:48] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:29:49] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 0 ms to minimize.
[2023-03-15 23:29:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6035 ms
[2023-03-15 23:29:49] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:29:49] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 0 ms to minimize.
[2023-03-15 23:29:50] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:29:50] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 1 ms to minimize.
[2023-03-15 23:29:50] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:29:50] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 0 ms to minimize.
[2023-03-15 23:29:50] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:29:51] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2023-03-15 23:29:51] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:29:51] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:29:52] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:29:52] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:29:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3077 ms
[2023-03-15 23:29:53] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 0 ms to minimize.
[2023-03-15 23:29:53] [INFO ] Deduced a trap composed of 67 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:29:53] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:29:54] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:29:54] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-15 23:29:54] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:29:55] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 1 ms to minimize.
[2023-03-15 23:29:55] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 1 ms to minimize.
[2023-03-15 23:29:55] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 0 ms to minimize.
[2023-03-15 23:29:56] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:29:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3530 ms
[2023-03-15 23:29:56] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:29:56] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 0 ms to minimize.
[2023-03-15 23:29:57] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 0 ms to minimize.
[2023-03-15 23:29:57] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-15 23:29:57] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:29:58] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2023-03-15 23:29:58] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:29:58] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2023-03-15 23:29:59] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:29:59] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 1 ms to minimize.
[2023-03-15 23:29:59] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:29:59] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:30:00] [INFO ] Deduced a trap composed of 72 places in 232 ms of which 0 ms to minimize.
[2023-03-15 23:30:00] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 0 ms to minimize.
[2023-03-15 23:30:00] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2023-03-15 23:30:00] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 0 ms to minimize.
[2023-03-15 23:30:01] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:30:01] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:30:01] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:30:02] [INFO ] Deduced a trap composed of 72 places in 225 ms of which 0 ms to minimize.
[2023-03-15 23:30:02] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:30:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6075 ms
[2023-03-15 23:30:02] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 0 ms to minimize.
[2023-03-15 23:30:03] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:30:03] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:30:03] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 1 ms to minimize.
[2023-03-15 23:30:03] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 0 ms to minimize.
[2023-03-15 23:30:04] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 0 ms to minimize.
[2023-03-15 23:30:04] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:30:04] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 0 ms to minimize.
[2023-03-15 23:30:04] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 0 ms to minimize.
[2023-03-15 23:30:05] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 0 ms to minimize.
[2023-03-15 23:30:05] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:30:05] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 0 ms to minimize.
[2023-03-15 23:30:05] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 0 ms to minimize.
[2023-03-15 23:30:05] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:30:06] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 0 ms to minimize.
[2023-03-15 23:30:06] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2023-03-15 23:30:06] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2023-03-15 23:30:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4068 ms
[2023-03-15 23:30:07] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-15 23:30:07] [INFO ] Deduced a trap composed of 27 places in 404 ms of which 1 ms to minimize.
[2023-03-15 23:30:07] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 2 ms to minimize.
[2023-03-15 23:30:08] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2023-03-15 23:30:08] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 0 ms to minimize.
[2023-03-15 23:30:08] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-15 23:30:09] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:30:09] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 1 ms to minimize.
[2023-03-15 23:30:09] [INFO ] Deduced a trap composed of 55 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:30:10] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2023-03-15 23:30:10] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 1 ms to minimize.
[2023-03-15 23:30:10] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:30:11] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:30:11] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2023-03-15 23:30:11] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:30:11] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:30:12] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 0 ms to minimize.
[2023-03-15 23:30:12] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 0 ms to minimize.
[2023-03-15 23:30:12] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:30:13] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 0 ms to minimize.
[2023-03-15 23:30:13] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:30:13] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 1 ms to minimize.
[2023-03-15 23:30:13] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:30:14] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 1 ms to minimize.
[2023-03-15 23:30:14] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:30:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7704 ms
[2023-03-15 23:30:14] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 0 ms to minimize.
[2023-03-15 23:30:14] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:30:15] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-15 23:30:15] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2023-03-15 23:30:15] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:30:15] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-15 23:30:16] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:30:16] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:30:16] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 1 ms to minimize.
[2023-03-15 23:30:16] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 0 ms to minimize.
[2023-03-15 23:30:17] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:30:17] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:30:17] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:30:18] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:30:18] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 1 ms to minimize.
[2023-03-15 23:30:18] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:30:18] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 0 ms to minimize.
[2023-03-15 23:30:18] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4496 ms
[2023-03-15 23:30:19] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:30:19] [INFO ] Deduced a trap composed of 60 places in 340 ms of which 1 ms to minimize.
[2023-03-15 23:30:20] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 1 ms to minimize.
[2023-03-15 23:30:20] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2023-03-15 23:30:20] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 1 ms to minimize.
[2023-03-15 23:30:21] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 1 ms to minimize.
[2023-03-15 23:30:21] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2023-03-15 23:30:21] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:30:21] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2023-03-15 23:30:21] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:30:22] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:30:22] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2023-03-15 23:30:22] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2023-03-15 23:30:23] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 0 ms to minimize.
[2023-03-15 23:30:23] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2023-03-15 23:30:23] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:30:23] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 1 ms to minimize.
[2023-03-15 23:30:24] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:30:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5120 ms
[2023-03-15 23:30:24] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2023-03-15 23:30:24] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 0 ms to minimize.
[2023-03-15 23:30:24] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 0 ms to minimize.
[2023-03-15 23:30:25] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 0 ms to minimize.
[2023-03-15 23:30:25] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 0 ms to minimize.
[2023-03-15 23:30:25] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:30:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1326 ms
[2023-03-15 23:30:26] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:30:26] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2023-03-15 23:30:27] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:30:27] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 1 ms to minimize.
[2023-03-15 23:30:27] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 1 ms to minimize.
[2023-03-15 23:30:27] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:30:28] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2023-03-15 23:30:28] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:30:28] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-15 23:30:28] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-15 23:30:28] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 0 ms to minimize.
[2023-03-15 23:30:29] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:30:29] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:30:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3302 ms
[2023-03-15 23:30:30] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:30:30] [INFO ] Deduced a trap composed of 59 places in 301 ms of which 0 ms to minimize.
[2023-03-15 23:30:30] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 0 ms to minimize.
[2023-03-15 23:30:31] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 0 ms to minimize.
[2023-03-15 23:30:31] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:30:31] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:30:31] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:30:32] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 0 ms to minimize.
[2023-03-15 23:30:32] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-15 23:30:32] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:30:32] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2023-03-15 23:30:32] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2023-03-15 23:30:33] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 0 ms to minimize.
[2023-03-15 23:30:33] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2023-03-15 23:30:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3804 ms
[2023-03-15 23:30:33] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:30:34] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:30:34] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2023-03-15 23:30:34] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 0 ms to minimize.
[2023-03-15 23:30:35] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 0 ms to minimize.
[2023-03-15 23:30:35] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:30:35] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:30:35] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 0 ms to minimize.
[2023-03-15 23:30:36] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:30:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2599 ms
[2023-03-15 23:30:36] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2023-03-15 23:30:36] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2023-03-15 23:30:37] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2023-03-15 23:30:37] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 1 ms to minimize.
[2023-03-15 23:30:37] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2023-03-15 23:30:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1432 ms
[2023-03-15 23:30:37] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2023-03-15 23:30:38] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:30:38] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:30:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 579 ms
[2023-03-15 23:30:38] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2023-03-15 23:30:38] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2023-03-15 23:30:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2023-03-15 23:30:39] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-15 23:30:39] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:30:39] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:30:40] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 1 ms to minimize.
[2023-03-15 23:30:40] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 0 ms to minimize.
[2023-03-15 23:30:40] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:30:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1073 ms
[2023-03-15 23:30:40] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2023-03-15 23:30:41] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:30:41] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-03-15 23:30:42] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:30:42] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2023-03-15 23:30:42] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2023-03-15 23:30:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1758 ms
[2023-03-15 23:30:42] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:30:43] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 0 ms to minimize.
[2023-03-15 23:30:43] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 0 ms to minimize.
[2023-03-15 23:30:43] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:30:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1074 ms
[2023-03-15 23:30:44] [INFO ] Deduced a trap composed of 12 places in 409 ms of which 1 ms to minimize.
[2023-03-15 23:30:44] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:30:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 782 ms
[2023-03-15 23:30:44] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2023-03-15 23:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-15 23:30:45] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2023-03-15 23:30:45] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 1 ms to minimize.
[2023-03-15 23:30:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2023-03-15 23:30:46] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 0 ms to minimize.
[2023-03-15 23:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-15 23:30:46] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2023-03-15 23:30:46] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 0 ms to minimize.
[2023-03-15 23:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 23:30:47] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-15 23:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-15 23:30:47] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:30:48] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:30:48] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:30:48] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-15 23:30:48] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 0 ms to minimize.
[2023-03-15 23:30:48] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:30:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1446 ms
[2023-03-15 23:30:49] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2023-03-15 23:30:49] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2023-03-15 23:30:50] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:30:50] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2023-03-15 23:30:50] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2023-03-15 23:30:50] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:30:50] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 0 ms to minimize.
[2023-03-15 23:30:51] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:30:51] [INFO ] Deduced a trap composed of 53 places in 269 ms of which 1 ms to minimize.
[2023-03-15 23:30:51] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 1 ms to minimize.
[2023-03-15 23:30:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2848 ms
[2023-03-15 23:30:52] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-15 23:30:52] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 0 ms to minimize.
[2023-03-15 23:30:53] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:30:53] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:30:53] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:30:54] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 2 ms to minimize.
[2023-03-15 23:30:54] [INFO ] Deduced a trap composed of 46 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:30:55] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 0 ms to minimize.
[2023-03-15 23:30:55] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 0 ms to minimize.
[2023-03-15 23:30:55] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 1 ms to minimize.
[2023-03-15 23:30:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3670 ms
[2023-03-15 23:30:56] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2023-03-15 23:30:56] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:30:58] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:30:59] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2023-03-15 23:30:59] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 1 ms to minimize.
[2023-03-15 23:30:59] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 0 ms to minimize.
[2023-03-15 23:30:59] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:30:59] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-15 23:31:00] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2023-03-15 23:31:00] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 1 ms to minimize.
[2023-03-15 23:31:00] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 1 ms to minimize.
[2023-03-15 23:31:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4778 ms
[2023-03-15 23:31:01] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:31:01] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-15 23:31:02] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:31:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 970 ms
[2023-03-15 23:31:02] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 23:31:02] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 0 ms to minimize.
[2023-03-15 23:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-15 23:31:03] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2023-03-15 23:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-15 23:31:04] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 0 ms to minimize.
[2023-03-15 23:31:04] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 0 ms to minimize.
[2023-03-15 23:31:05] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 0 ms to minimize.
[2023-03-15 23:31:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 963 ms
[2023-03-15 23:31:06] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 1 ms to minimize.
[2023-03-15 23:31:06] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 0 ms to minimize.
[2023-03-15 23:31:06] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:31:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 845 ms
[2023-03-15 23:31:06] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2023-03-15 23:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-15 23:31:08] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 0 ms to minimize.
[2023-03-15 23:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-15 23:31:08] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2023-03-15 23:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-15 23:31:09] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-15 23:31:09] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2023-03-15 23:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-15 23:31:11] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:31:11] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:31:11] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:31:11] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 1 ms to minimize.
[2023-03-15 23:31:12] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:31:12] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:31:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2199 ms
[2023-03-15 23:31:13] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 0 ms to minimize.
[2023-03-15 23:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-15 23:31:14] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2023-03-15 23:31:14] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 1 ms to minimize.
[2023-03-15 23:31:14] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 0 ms to minimize.
[2023-03-15 23:31:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 551 ms
[2023-03-15 23:31:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-15 23:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-15 23:31:19] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-15 23:31:19] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2023-03-15 23:31:19] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 0 ms to minimize.
[2023-03-15 23:31:20] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:31:20] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 1 ms to minimize.
[2023-03-15 23:31:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1392 ms
[2023-03-15 23:31:20] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 1 ms to minimize.
[2023-03-15 23:31:21] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2023-03-15 23:31:21] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2023-03-15 23:31:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2023-03-15 23:31:22] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-15 23:31:23] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 0 ms to minimize.
[2023-03-15 23:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-15 23:31:23] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 1 ms to minimize.
[2023-03-15 23:31:23] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:31:24] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:31:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1044 ms
[2023-03-15 23:31:24] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 1 ms to minimize.
[2023-03-15 23:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-15 23:31:26] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-15 23:31:26] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:31:27] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:31:27] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:31:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1688 ms
[2023-03-15 23:31:28] [INFO ] Deduced a trap composed of 52 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-15 23:31:28] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 1 ms to minimize.
[2023-03-15 23:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-15 23:31:29] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2023-03-15 23:31:29] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-15 23:31:29] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2023-03-15 23:31:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 635 ms
[2023-03-15 23:31:30] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 1 ms to minimize.
[2023-03-15 23:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2023-03-15 23:31:32] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2023-03-15 23:31:32] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2023-03-15 23:31:34] [INFO ] Deduced a trap composed of 27 places in 372 ms of which 0 ms to minimize.
[2023-03-15 23:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-15 23:31:34] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2023-03-15 23:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-15 23:31:35] [INFO ] Deduced a trap composed of 38 places in 364 ms of which 1 ms to minimize.
[2023-03-15 23:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-15 23:31:36] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-15 23:31:38] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 1 ms to minimize.
[2023-03-15 23:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-15 23:31:39] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 0 ms to minimize.
[2023-03-15 23:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 611 ms
[2023-03-15 23:31:40] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 0 ms to minimize.
[2023-03-15 23:31:40] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 0 ms to minimize.
[2023-03-15 23:31:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-03-15 23:31:41] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-15 23:31:44] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 0 ms to minimize.
[2023-03-15 23:31:45] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:31:45] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 1 ms to minimize.
[2023-03-15 23:31:46] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:31:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2256 ms
[2023-03-15 23:31:47] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 1 ms to minimize.
[2023-03-15 23:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 23:31:48] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 0 ms to minimize.
[2023-03-15 23:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-15 23:31:49] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2023-03-15 23:31:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-15 23:31:50] [INFO ] Deduced a trap composed of 18 places in 384 ms of which 1 ms to minimize.
[2023-03-15 23:31:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2023-03-15 23:31:51] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 0 ms to minimize.
[2023-03-15 23:31:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 23:31:52] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 4 ms to minimize.
[2023-03-15 23:31:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1046 ms
[2023-03-15 23:31:54] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 1 ms to minimize.
[2023-03-15 23:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2023-03-15 23:31:54] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 2 ms to minimize.
[2023-03-15 23:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 554 ms
[2023-03-15 23:31:55] [INFO ] Deduced a trap composed of 27 places in 387 ms of which 1 ms to minimize.
[2023-03-15 23:31:55] [INFO ] Deduced a trap composed of 18 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:31:56] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:31:56] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 0 ms to minimize.
[2023-03-15 23:31:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1772 ms
[2023-03-15 23:31:57] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 1 ms to minimize.
[2023-03-15 23:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-15 23:31:59] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 0 ms to minimize.
[2023-03-15 23:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-15 23:32:02] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 1 ms to minimize.
[2023-03-15 23:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 23:32:04] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 1 ms to minimize.
[2023-03-15 23:32:04] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 1 ms to minimize.
[2023-03-15 23:32:04] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 1 ms to minimize.
[2023-03-15 23:32:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1338 ms
[2023-03-15 23:32:05] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-15 23:32:06] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2023-03-15 23:32:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 953 ms
[2023-03-15 23:32:06] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 1 ms to minimize.
[2023-03-15 23:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-03-15 23:32:09] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 0 ms to minimize.
[2023-03-15 23:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-15 23:32:14] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:32:15] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2023-03-15 23:32:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2023-03-15 23:32:15] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 1 ms to minimize.
[2023-03-15 23:32:16] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 0 ms to minimize.
[2023-03-15 23:32:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1317 ms
[2023-03-15 23:32:17] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-15 23:32:19] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 1 ms to minimize.
[2023-03-15 23:32:19] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 892 ms
[2023-03-15 23:32:20] [INFO ] Deduced a trap composed of 58 places in 357 ms of which 1 ms to minimize.
[2023-03-15 23:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 477 ms
[2023-03-15 23:32:20] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 1 ms to minimize.
[2023-03-15 23:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2023-03-15 23:32:23] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 0 ms to minimize.
[2023-03-15 23:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2023-03-15 23:32:25] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-15 23:32:29] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2023-03-15 23:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-03-15 23:32:43] [INFO ] Deduced a trap composed of 55 places in 366 ms of which 1 ms to minimize.
[2023-03-15 23:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-15 23:32:48] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2023-03-15 23:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-15 23:32:49] [INFO ] Deduced a trap composed of 56 places in 350 ms of which 1 ms to minimize.
[2023-03-15 23:32:50] [INFO ] Deduced a trap composed of 64 places in 329 ms of which 1 ms to minimize.
[2023-03-15 23:32:50] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:32:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1270 ms
[2023-03-15 23:32:50] [INFO ] Deduced a trap composed of 58 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:32:51] [INFO ] Deduced a trap composed of 88 places in 325 ms of which 1 ms to minimize.
[2023-03-15 23:32:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 847 ms
[2023-03-15 23:32:54] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2023-03-15 23:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-15 23:32:55] [INFO ] Deduced a trap composed of 29 places in 299 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-15 23:32:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:32:55] [INFO ] After 225059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:367
Fused 367 Parikh solutions to 342 different solutions.
Parikh walk visited 0 properties in 5215 ms.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 41 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:33:00] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:33:00] [INFO ] Invariant cache hit.
[2023-03-15 23:33:00] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-15 23:33:00] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:33:00] [INFO ] Invariant cache hit.
[2023-03-15 23:33:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:33:02] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2023-03-15 23:33:02] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 23:33:02] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:33:02] [INFO ] Invariant cache hit.
[2023-03-15 23:33:03] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2460 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4396 ms. (steps per millisecond=22 ) properties (out of 268) seen :95
Running SMT prover for 173 properties.
[2023-03-15 23:33:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:33:07] [INFO ] Invariant cache hit.
[2023-03-15 23:33:07] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:33:08] [INFO ] After 606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :173
[2023-03-15 23:33:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:33:09] [INFO ] After 946ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :173
[2023-03-15 23:33:09] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-15 23:33:09] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:33:10] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:33:10] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 0 ms to minimize.
[2023-03-15 23:33:10] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 0 ms to minimize.
[2023-03-15 23:33:10] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 1 ms to minimize.
[2023-03-15 23:33:11] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 0 ms to minimize.
[2023-03-15 23:33:11] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 1 ms to minimize.
[2023-03-15 23:33:11] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 1 ms to minimize.
[2023-03-15 23:33:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2214 ms
[2023-03-15 23:33:11] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 0 ms to minimize.
[2023-03-15 23:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-15 23:33:12] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 0 ms to minimize.
[2023-03-15 23:33:12] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 0 ms to minimize.
[2023-03-15 23:33:12] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 0 ms to minimize.
[2023-03-15 23:33:13] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 1 ms to minimize.
[2023-03-15 23:33:13] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 1 ms to minimize.
[2023-03-15 23:33:13] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 0 ms to minimize.
[2023-03-15 23:33:13] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:33:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1699 ms
[2023-03-15 23:33:14] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 23:33:15] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 0 ms to minimize.
[2023-03-15 23:33:15] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2023-03-15 23:33:15] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 1 ms to minimize.
[2023-03-15 23:33:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 871 ms
[2023-03-15 23:33:16] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2023-03-15 23:33:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-15 23:33:16] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-15 23:33:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-15 23:33:18] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2023-03-15 23:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-15 23:33:18] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 1 ms to minimize.
[2023-03-15 23:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-15 23:33:18] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 0 ms to minimize.
[2023-03-15 23:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 23:33:19] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 0 ms to minimize.
[2023-03-15 23:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-15 23:33:19] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2023-03-15 23:33:19] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 0 ms to minimize.
[2023-03-15 23:33:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2023-03-15 23:33:19] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 0 ms to minimize.
[2023-03-15 23:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-15 23:33:20] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2023-03-15 23:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-15 23:33:21] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 0 ms to minimize.
[2023-03-15 23:33:21] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 0 ms to minimize.
[2023-03-15 23:33:21] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 0 ms to minimize.
[2023-03-15 23:33:22] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:33:22] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 1 ms to minimize.
[2023-03-15 23:33:22] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:33:22] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 0 ms to minimize.
[2023-03-15 23:33:23] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:33:23] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 1 ms to minimize.
[2023-03-15 23:33:23] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 0 ms to minimize.
[2023-03-15 23:33:23] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 0 ms to minimize.
[2023-03-15 23:33:23] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 1 ms to minimize.
[2023-03-15 23:33:24] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2023-03-15 23:33:24] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 0 ms to minimize.
[2023-03-15 23:33:24] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 1 ms to minimize.
[2023-03-15 23:33:24] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-15 23:33:24] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3880 ms
[2023-03-15 23:33:25] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:33:25] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 1 ms to minimize.
[2023-03-15 23:33:25] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2023-03-15 23:33:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 693 ms
[2023-03-15 23:33:26] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 0 ms to minimize.
[2023-03-15 23:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-15 23:33:26] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 1 ms to minimize.
[2023-03-15 23:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-15 23:33:27] [INFO ] Deduced a trap composed of 55 places in 302 ms of which 0 ms to minimize.
[2023-03-15 23:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-15 23:33:27] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2023-03-15 23:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 23:33:28] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2023-03-15 23:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 23:33:28] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:33:29] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:33:29] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 1 ms to minimize.
[2023-03-15 23:33:29] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 0 ms to minimize.
[2023-03-15 23:33:29] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 1 ms to minimize.
[2023-03-15 23:33:30] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 0 ms to minimize.
[2023-03-15 23:33:30] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 0 ms to minimize.
[2023-03-15 23:33:30] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 0 ms to minimize.
[2023-03-15 23:33:30] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 1 ms to minimize.
[2023-03-15 23:33:31] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:33:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2440 ms
[2023-03-15 23:33:31] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 0 ms to minimize.
[2023-03-15 23:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-15 23:33:32] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 1 ms to minimize.
[2023-03-15 23:33:32] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2023-03-15 23:33:32] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 0 ms to minimize.
[2023-03-15 23:33:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 562 ms
[2023-03-15 23:33:33] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2023-03-15 23:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-15 23:33:33] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 1 ms to minimize.
[2023-03-15 23:33:33] [INFO ] Deduced a trap composed of 53 places in 251 ms of which 1 ms to minimize.
[2023-03-15 23:33:34] [INFO ] Deduced a trap composed of 77 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:33:34] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 1 ms to minimize.
[2023-03-15 23:33:34] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 1 ms to minimize.
[2023-03-15 23:33:34] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 1 ms to minimize.
[2023-03-15 23:33:35] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 0 ms to minimize.
[2023-03-15 23:33:35] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:33:35] [INFO ] Deduced a trap composed of 88 places in 296 ms of which 1 ms to minimize.
[2023-03-15 23:33:36] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 1 ms to minimize.
[2023-03-15 23:33:36] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:33:36] [INFO ] Deduced a trap composed of 72 places in 232 ms of which 1 ms to minimize.
[2023-03-15 23:33:37] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 0 ms to minimize.
[2023-03-15 23:33:37] [INFO ] Deduced a trap composed of 64 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:33:37] [INFO ] Deduced a trap composed of 55 places in 406 ms of which 1 ms to minimize.
[2023-03-15 23:33:38] [INFO ] Deduced a trap composed of 81 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:33:38] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 1 ms to minimize.
[2023-03-15 23:33:38] [INFO ] Deduced a trap composed of 84 places in 270 ms of which 0 ms to minimize.
[2023-03-15 23:33:39] [INFO ] Deduced a trap composed of 72 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:33:39] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:33:39] [INFO ] Deduced a trap composed of 81 places in 237 ms of which 1 ms to minimize.
[2023-03-15 23:33:40] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 1 ms to minimize.
[2023-03-15 23:33:40] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:33:40] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 1 ms to minimize.
[2023-03-15 23:33:41] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:33:41] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:33:42] [INFO ] Deduced a trap composed of 73 places in 311 ms of which 1 ms to minimize.
[2023-03-15 23:33:42] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:33:42] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9138 ms
[2023-03-15 23:33:42] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 1 ms to minimize.
[2023-03-15 23:33:42] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 0 ms to minimize.
[2023-03-15 23:33:43] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:33:43] [INFO ] Deduced a trap composed of 58 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:33:43] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 1 ms to minimize.
[2023-03-15 23:33:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1588 ms
[2023-03-15 23:33:44] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 1 ms to minimize.
[2023-03-15 23:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-15 23:33:44] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2023-03-15 23:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-15 23:33:45] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:33:45] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 1 ms to minimize.
[2023-03-15 23:33:46] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:33:46] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 0 ms to minimize.
[2023-03-15 23:33:46] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 1 ms to minimize.
[2023-03-15 23:33:46] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:33:47] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:33:47] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:33:47] [INFO ] Deduced a trap composed of 86 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:33:48] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 0 ms to minimize.
[2023-03-15 23:33:48] [INFO ] Deduced a trap composed of 75 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:33:48] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:33:49] [INFO ] Deduced a trap composed of 100 places in 397 ms of which 1 ms to minimize.
[2023-03-15 23:33:49] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 0 ms to minimize.
[2023-03-15 23:33:50] [INFO ] Deduced a trap composed of 86 places in 353 ms of which 1 ms to minimize.
[2023-03-15 23:33:50] [INFO ] Deduced a trap composed of 76 places in 403 ms of which 1 ms to minimize.
[2023-03-15 23:33:50] [INFO ] Deduced a trap composed of 77 places in 418 ms of which 1 ms to minimize.
[2023-03-15 23:33:51] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 1 ms to minimize.
[2023-03-15 23:33:51] [INFO ] Deduced a trap composed of 83 places in 333 ms of which 1 ms to minimize.
[2023-03-15 23:33:52] [INFO ] Deduced a trap composed of 66 places in 363 ms of which 1 ms to minimize.
[2023-03-15 23:33:52] [INFO ] Deduced a trap composed of 87 places in 392 ms of which 1 ms to minimize.
[2023-03-15 23:33:52] [INFO ] Deduced a trap composed of 83 places in 261 ms of which 1 ms to minimize.
[2023-03-15 23:33:53] [INFO ] Deduced a trap composed of 65 places in 309 ms of which 0 ms to minimize.
[2023-03-15 23:33:53] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 1 ms to minimize.
[2023-03-15 23:33:53] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 0 ms to minimize.
[2023-03-15 23:33:54] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 1 ms to minimize.
[2023-03-15 23:33:54] [INFO ] Deduced a trap composed of 79 places in 272 ms of which 1 ms to minimize.
[2023-03-15 23:33:54] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:33:54] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9969 ms
[2023-03-15 23:33:55] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 0 ms to minimize.
[2023-03-15 23:33:55] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 1 ms to minimize.
[2023-03-15 23:33:55] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 0 ms to minimize.
[2023-03-15 23:33:56] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 0 ms to minimize.
[2023-03-15 23:33:56] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:33:56] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:33:57] [INFO ] Deduced a trap composed of 47 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:33:57] [INFO ] Deduced a trap composed of 77 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:33:58] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 0 ms to minimize.
[2023-03-15 23:33:58] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 1 ms to minimize.
[2023-03-15 23:33:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3408 ms
[2023-03-15 23:33:58] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 1 ms to minimize.
[2023-03-15 23:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-15 23:33:59] [INFO ] Deduced a trap composed of 56 places in 347 ms of which 1 ms to minimize.
[2023-03-15 23:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-15 23:33:59] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 1 ms to minimize.
[2023-03-15 23:34:00] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 1 ms to minimize.
[2023-03-15 23:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2023-03-15 23:34:00] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 0 ms to minimize.
[2023-03-15 23:34:00] [INFO ] Deduced a trap composed of 80 places in 402 ms of which 1 ms to minimize.
[2023-03-15 23:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 845 ms
[2023-03-15 23:34:01] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 1 ms to minimize.
[2023-03-15 23:34:01] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 1 ms to minimize.
[2023-03-15 23:34:02] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 1 ms to minimize.
[2023-03-15 23:34:02] [INFO ] Deduced a trap composed of 56 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:34:02] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 0 ms to minimize.
[2023-03-15 23:34:03] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 0 ms to minimize.
[2023-03-15 23:34:03] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:34:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2577 ms
[2023-03-15 23:34:04] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-15 23:34:04] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 1 ms to minimize.
[2023-03-15 23:34:05] [INFO ] Deduced a trap composed of 87 places in 425 ms of which 1 ms to minimize.
[2023-03-15 23:34:05] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 1 ms to minimize.
[2023-03-15 23:34:06] [INFO ] Deduced a trap composed of 80 places in 413 ms of which 1 ms to minimize.
[2023-03-15 23:34:06] [INFO ] Deduced a trap composed of 68 places in 427 ms of which 1 ms to minimize.
[2023-03-15 23:34:07] [INFO ] Deduced a trap composed of 72 places in 416 ms of which 1 ms to minimize.
[2023-03-15 23:34:07] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 1 ms to minimize.
[2023-03-15 23:34:08] [INFO ] Deduced a trap composed of 64 places in 434 ms of which 1 ms to minimize.
[2023-03-15 23:34:08] [INFO ] Deduced a trap composed of 68 places in 399 ms of which 1 ms to minimize.
[2023-03-15 23:34:08] [INFO ] Deduced a trap composed of 62 places in 432 ms of which 1 ms to minimize.
[2023-03-15 23:34:09] [INFO ] Deduced a trap composed of 62 places in 417 ms of which 1 ms to minimize.
[2023-03-15 23:34:09] [INFO ] Deduced a trap composed of 79 places in 312 ms of which 1 ms to minimize.
[2023-03-15 23:34:10] [INFO ] Deduced a trap composed of 82 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:34:10] [INFO ] Deduced a trap composed of 70 places in 379 ms of which 1 ms to minimize.
[2023-03-15 23:34:10] [INFO ] Deduced a trap composed of 73 places in 286 ms of which 3 ms to minimize.
[2023-03-15 23:34:11] [INFO ] Deduced a trap composed of 58 places in 388 ms of which 0 ms to minimize.
[2023-03-15 23:34:11] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:34:12] [INFO ] Deduced a trap composed of 85 places in 337 ms of which 1 ms to minimize.
[2023-03-15 23:34:12] [INFO ] Deduced a trap composed of 88 places in 346 ms of which 1 ms to minimize.
[2023-03-15 23:34:12] [INFO ] Deduced a trap composed of 74 places in 338 ms of which 0 ms to minimize.
[2023-03-15 23:34:13] [INFO ] Deduced a trap composed of 101 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:34:13] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 0 ms to minimize.
[2023-03-15 23:34:14] [INFO ] Deduced a trap composed of 67 places in 345 ms of which 0 ms to minimize.
[2023-03-15 23:34:14] [INFO ] Deduced a trap composed of 78 places in 274 ms of which 0 ms to minimize.
[2023-03-15 23:34:14] [INFO ] Deduced a trap composed of 93 places in 387 ms of which 1 ms to minimize.
[2023-03-15 23:34:15] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 1 ms to minimize.
[2023-03-15 23:34:15] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 1 ms to minimize.
[2023-03-15 23:34:15] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 11276 ms
[2023-03-15 23:34:16] [INFO ] Deduced a trap composed of 58 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:34:16] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 1 ms to minimize.
[2023-03-15 23:34:16] [INFO ] Deduced a trap composed of 54 places in 241 ms of which 0 ms to minimize.
[2023-03-15 23:34:16] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 1 ms to minimize.
[2023-03-15 23:34:17] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 1 ms to minimize.
[2023-03-15 23:34:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1584 ms
[2023-03-15 23:34:17] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-15 23:34:17] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 1 ms to minimize.
[2023-03-15 23:34:18] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:34:18] [INFO ] Deduced a trap composed of 81 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:34:18] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:34:19] [INFO ] Deduced a trap composed of 78 places in 277 ms of which 1 ms to minimize.
[2023-03-15 23:34:19] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 0 ms to minimize.
[2023-03-15 23:34:19] [INFO ] Deduced a trap composed of 79 places in 265 ms of which 1 ms to minimize.
[2023-03-15 23:34:20] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:34:20] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 1 ms to minimize.
[2023-03-15 23:34:20] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 0 ms to minimize.
[2023-03-15 23:34:21] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:34:21] [INFO ] Deduced a trap composed of 51 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:34:21] [INFO ] Deduced a trap composed of 66 places in 303 ms of which 1 ms to minimize.
[2023-03-15 23:34:22] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 0 ms to minimize.
[2023-03-15 23:34:22] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 0 ms to minimize.
[2023-03-15 23:34:22] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 0 ms to minimize.
[2023-03-15 23:34:22] [INFO ] Deduced a trap composed of 94 places in 225 ms of which 0 ms to minimize.
[2023-03-15 23:34:23] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 1 ms to minimize.
[2023-03-15 23:34:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6005 ms
[2023-03-15 23:34:23] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-15 23:34:24] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 1 ms to minimize.
[2023-03-15 23:34:24] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 1 ms to minimize.
[2023-03-15 23:34:24] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 1 ms to minimize.
[2023-03-15 23:34:24] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 0 ms to minimize.
[2023-03-15 23:34:25] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 0 ms to minimize.
[2023-03-15 23:34:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1327 ms
[2023-03-15 23:34:25] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 0 ms to minimize.
[2023-03-15 23:34:26] [INFO ] Deduced a trap composed of 79 places in 263 ms of which 1 ms to minimize.
[2023-03-15 23:34:26] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 1 ms to minimize.
[2023-03-15 23:34:26] [INFO ] Deduced a trap composed of 58 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:34:27] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 1 ms to minimize.
[2023-03-15 23:34:27] [INFO ] Deduced a trap composed of 77 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:34:27] [INFO ] Deduced a trap composed of 96 places in 269 ms of which 1 ms to minimize.
[2023-03-15 23:34:28] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 0 ms to minimize.
[2023-03-15 23:34:28] [INFO ] Deduced a trap composed of 80 places in 384 ms of which 1 ms to minimize.
[2023-03-15 23:34:28] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 1 ms to minimize.
[2023-03-15 23:34:29] [INFO ] Deduced a trap composed of 70 places in 345 ms of which 1 ms to minimize.
[2023-03-15 23:34:29] [INFO ] Deduced a trap composed of 72 places in 376 ms of which 1 ms to minimize.
[2023-03-15 23:34:30] [INFO ] Deduced a trap composed of 57 places in 307 ms of which 0 ms to minimize.
[2023-03-15 23:34:30] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2023-03-15 23:34:30] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 1 ms to minimize.
[2023-03-15 23:34:31] [INFO ] Deduced a trap composed of 73 places in 234 ms of which 1 ms to minimize.
[2023-03-15 23:34:31] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:34:31] [INFO ] Deduced a trap composed of 74 places in 334 ms of which 1 ms to minimize.
[2023-03-15 23:34:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6405 ms
[2023-03-15 23:34:32] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 1 ms to minimize.
[2023-03-15 23:34:33] [INFO ] Deduced a trap composed of 52 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:34:33] [INFO ] Deduced a trap composed of 67 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:34:34] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 1 ms to minimize.
[2023-03-15 23:34:34] [INFO ] Deduced a trap composed of 52 places in 340 ms of which 0 ms to minimize.
[2023-03-15 23:34:34] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 1 ms to minimize.
[2023-03-15 23:34:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2275 ms
[2023-03-15 23:34:35] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 1 ms to minimize.
[2023-03-15 23:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-15 23:34:35] [INFO ] Deduced a trap composed of 76 places in 342 ms of which 1 ms to minimize.
[2023-03-15 23:34:36] [INFO ] Deduced a trap composed of 50 places in 345 ms of which 0 ms to minimize.
[2023-03-15 23:34:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 847 ms
[2023-03-15 23:34:36] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 0 ms to minimize.
[2023-03-15 23:34:36] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 1 ms to minimize.
[2023-03-15 23:34:37] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:34:37] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 1 ms to minimize.
[2023-03-15 23:34:37] [INFO ] Deduced a trap composed of 87 places in 330 ms of which 1 ms to minimize.
[2023-03-15 23:34:38] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 1 ms to minimize.
[2023-03-15 23:34:38] [INFO ] Deduced a trap composed of 70 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:34:39] [INFO ] Deduced a trap composed of 89 places in 379 ms of which 1 ms to minimize.
[2023-03-15 23:34:39] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 1 ms to minimize.
[2023-03-15 23:34:39] [INFO ] Deduced a trap composed of 83 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:34:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3491 ms
[2023-03-15 23:34:40] [INFO ] Deduced a trap composed of 44 places in 330 ms of which 0 ms to minimize.
[2023-03-15 23:34:40] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:34:40] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 0 ms to minimize.
[2023-03-15 23:34:41] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 0 ms to minimize.
[2023-03-15 23:34:41] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 0 ms to minimize.
[2023-03-15 23:34:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1612 ms
[2023-03-15 23:34:41] [INFO ] Deduced a trap composed of 50 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:34:42] [INFO ] Deduced a trap composed of 72 places in 242 ms of which 1 ms to minimize.
[2023-03-15 23:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-15 23:34:42] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 0 ms to minimize.
[2023-03-15 23:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-15 23:34:42] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 0 ms to minimize.
[2023-03-15 23:34:43] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 0 ms to minimize.
[2023-03-15 23:34:43] [INFO ] Deduced a trap composed of 81 places in 227 ms of which 1 ms to minimize.
[2023-03-15 23:34:43] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 1 ms to minimize.
[2023-03-15 23:34:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1161 ms
[2023-03-15 23:34:44] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 1 ms to minimize.
[2023-03-15 23:34:44] [INFO ] Deduced a trap composed of 82 places in 253 ms of which 1 ms to minimize.
[2023-03-15 23:34:44] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 0 ms to minimize.
[2023-03-15 23:34:44] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 1 ms to minimize.
[2023-03-15 23:34:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1158 ms
[2023-03-15 23:34:45] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 0 ms to minimize.
[2023-03-15 23:34:45] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 0 ms to minimize.
[2023-03-15 23:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 565 ms
[2023-03-15 23:34:46] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2023-03-15 23:34:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-15 23:34:46] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 1 ms to minimize.
[2023-03-15 23:34:47] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 0 ms to minimize.
[2023-03-15 23:34:47] [INFO ] Deduced a trap composed of 42 places in 286 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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-15 23:34:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 23:34:47] [INFO ] After 100146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Finished random walk after 985 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=164 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 683984 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683984 steps, saw 90735 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:34:50] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:34:50] [INFO ] Invariant cache hit.
[2023-03-15 23:34:50] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:34:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 23:34:51] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:34:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:34:51] [INFO ] After 76ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:34:51] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 1 ms to minimize.
[2023-03-15 23:34:52] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 1 ms to minimize.
[2023-03-15 23:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-15 23:34:52] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 23:34:52] [INFO ] After 1254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 29 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 760536 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 760536 steps, saw 101901 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:34:55] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:34:55] [INFO ] Invariant cache hit.
[2023-03-15 23:34:55] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:34:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 23:34:55] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:34:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:34:55] [INFO ] After 78ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:34:56] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:34:56] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 1 ms to minimize.
[2023-03-15 23:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2023-03-15 23:34:56] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-15 23:34:56] [INFO ] After 1164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 29 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:34:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:34:56] [INFO ] Invariant cache hit.
[2023-03-15 23:34:57] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-15 23:34:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:34:57] [INFO ] Invariant cache hit.
[2023-03-15 23:34:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:34:59] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2023-03-15 23:34:59] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-15 23:34:59] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:34:59] [INFO ] Invariant cache hit.
[2023-03-15 23:35:00] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3772 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 289 / 399 are part of one of the 42 SCC in 6 ms
Free SCC test removed 247 places
Drop transitions removed 494 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 745 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 152 transition count 320
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 111 transition count 320
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 107 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 116 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 130 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 182 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 218 place count 2 transition count 2
Applied a total of 218 rules in 34 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:35:00] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 23:35:00] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 23:35:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:00] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 23:35:00] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 349678 steps, run visited all 1 properties in 1305 ms. (steps per millisecond=267 )
Probabilistic random walk after 349678 steps, saw 48531 distinct states, run finished after 1306 ms. (steps per millisecond=267 ) properties seen :1
Finished random walk after 3802 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=345 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4238 steps, run visited all 1 properties in 21 ms. (steps per millisecond=201 )
Probabilistic random walk after 4238 steps, saw 2439 distinct states, run finished after 21 ms. (steps per millisecond=201 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished Best-First random walk after 5457 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1091 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819280 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 819280 steps, saw 107846 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:04] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:35:04] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 23:35:05] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 23:35:05] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:05] [INFO ] After 109ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:05] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-15 23:35:05] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 24 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 778688 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 778688 steps, saw 104269 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:08] [INFO ] Invariant cache hit.
[2023-03-15 23:35:09] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 23:35:09] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:09] [INFO ] After 104ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:09] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 23:35:09] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 17 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 17 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:35:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:09] [INFO ] Invariant cache hit.
[2023-03-15 23:35:10] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-15 23:35:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:10] [INFO ] Invariant cache hit.
[2023-03-15 23:35:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:12] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-15 23:35:12] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 23:35:12] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:12] [INFO ] Invariant cache hit.
[2023-03-15 23:35:13] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4118 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 3 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 35 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:35:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 23:35:14] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 23:35:14] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:14] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 23:35:14] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 738264 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738264 steps, saw 99767 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:17] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:35:17] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 23:35:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:35:17] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:17] [INFO ] After 119ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:17] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 23:35:17] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 779496 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 779496 steps, saw 104323 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:20] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:20] [INFO ] Invariant cache hit.
[2023-03-15 23:35:21] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 23:35:21] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:21] [INFO ] After 120ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:21] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 23:35:21] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:35:22] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:22] [INFO ] Invariant cache hit.
[2023-03-15 23:35:22] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-15 23:35:22] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:22] [INFO ] Invariant cache hit.
[2023-03-15 23:35:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:25] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 3948 ms to find 0 implicit places.
[2023-03-15 23:35:25] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 23:35:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:25] [INFO ] Invariant cache hit.
[2023-03-15 23:35:27] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5283 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 22 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:35:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 23:35:27] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 23:35:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:27] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 23:35:27] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 749960 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 749960 steps, saw 100956 distinct states, run finished after 3011 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:30] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:35:30] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 23:35:30] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 23:35:30] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:31] [INFO ] After 114ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:31] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-15 23:35:31] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 30 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 751568 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 751568 steps, saw 101073 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:34] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:34] [INFO ] Invariant cache hit.
[2023-03-15 23:35:34] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 23:35:35] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:35] [INFO ] After 100ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:35] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 23:35:35] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:35:35] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:35] [INFO ] Invariant cache hit.
[2023-03-15 23:35:36] [INFO ] Implicit Places using invariants in 785 ms returned []
[2023-03-15 23:35:36] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:36] [INFO ] Invariant cache hit.
[2023-03-15 23:35:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:38] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
[2023-03-15 23:35:38] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 23:35:38] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:38] [INFO ] Invariant cache hit.
[2023-03-15 23:35:39] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4151 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 30 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:35:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 23:35:39] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 23:35:39] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:39] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 23:35:39] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4404 steps, run visited all 1 properties in 37 ms. (steps per millisecond=119 )
Probabilistic random walk after 4404 steps, saw 2543 distinct states, run finished after 37 ms. (steps per millisecond=119 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 728256 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728256 steps, saw 98785 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:42] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:35:42] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 23:35:42] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:35:43] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:43] [INFO ] After 114ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:43] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 23:35:43] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 762856 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 762856 steps, saw 102170 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:46] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:46] [INFO ] Invariant cache hit.
[2023-03-15 23:35:46] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 23:35:47] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:47] [INFO ] After 109ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:47] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-15 23:35:47] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 31 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 21 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:35:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:47] [INFO ] Invariant cache hit.
[2023-03-15 23:35:48] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-15 23:35:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:48] [INFO ] Invariant cache hit.
[2023-03-15 23:35:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:51] [INFO ] Implicit Places using invariants and state equation in 2821 ms returned []
Implicit Place search using SMT with State Equation took 3564 ms to find 0 implicit places.
[2023-03-15 23:35:51] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 23:35:51] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:51] [INFO ] Invariant cache hit.
[2023-03-15 23:35:52] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4582 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 17 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:35:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 23:35:52] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 23:35:52] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:52] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 23:35:52] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 4302 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=286 )
Finished random walk after 7174 steps, including 2 resets, run visited all 1 properties in 24 ms. (steps per millisecond=298 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 774400 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 774400 steps, saw 103613 distinct states, run finished after 3004 ms. (steps per millisecond=257 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:55] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:35:55] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 23:35:55] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 23:35:56] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:35:56] [INFO ] After 92ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:35:56] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-15 23:35:56] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 21 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 778416 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 778416 steps, saw 104256 distinct states, run finished after 3003 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:35:59] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:35:59] [INFO ] Invariant cache hit.
[2023-03-15 23:35:59] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:35:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 23:36:00] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:00] [INFO ] After 119ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:00] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 23:36:00] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:36:00] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:00] [INFO ] Invariant cache hit.
[2023-03-15 23:36:01] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-15 23:36:01] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:01] [INFO ] Invariant cache hit.
[2023-03-15 23:36:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:04] [INFO ] Implicit Places using invariants and state equation in 3180 ms returned []
Implicit Place search using SMT with State Equation took 3972 ms to find 0 implicit places.
[2023-03-15 23:36:04] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 23:36:04] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:04] [INFO ] Invariant cache hit.
[2023-03-15 23:36:05] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5467 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 6 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 24 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:36:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 23:36:05] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 23:36:06] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:06] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 23:36:06] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 685632 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685632 steps, saw 90888 distinct states, run finished after 3006 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:36:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:36:09] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 23:36:09] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 23:36:09] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:09] [INFO ] After 119ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:09] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 23:36:10] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 23 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 731480 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 731480 steps, saw 99124 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:36:13] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:13] [INFO ] Invariant cache hit.
[2023-03-15 23:36:13] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:36:13] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:13] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:13] [INFO ] After 108ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:13] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 23:36:14] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 23 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 23 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:36:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:14] [INFO ] Invariant cache hit.
[2023-03-15 23:36:14] [INFO ] Implicit Places using invariants in 811 ms returned []
[2023-03-15 23:36:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:14] [INFO ] Invariant cache hit.
[2023-03-15 23:36:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:18] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned []
Implicit Place search using SMT with State Equation took 4097 ms to find 0 implicit places.
[2023-03-15 23:36:18] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 23:36:18] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:18] [INFO ] Invariant cache hit.
[2023-03-15 23:36:19] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5273 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 2 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 24 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:36:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 23:36:19] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 23:36:19] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:19] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 23:36:19] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15062 steps, run visited all 1 properties in 65 ms. (steps per millisecond=231 )
Probabilistic random walk after 15062 steps, saw 7804 distinct states, run finished after 66 ms. (steps per millisecond=228 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 719228 steps, run visited all 1 properties in 2769 ms. (steps per millisecond=259 )
Probabilistic random walk after 719228 steps, saw 95753 distinct states, run finished after 2769 ms. (steps per millisecond=259 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 777368 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 777368 steps, saw 104133 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:36:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 23:36:25] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 23:36:25] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 23:36:25] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:25] [INFO ] After 67ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:26] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 23:36:26] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 779928 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 779928 steps, saw 104353 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:36:29] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:29] [INFO ] Invariant cache hit.
[2023-03-15 23:36:29] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 23:36:29] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:29] [INFO ] After 79ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:29] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 23:36:29] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 23:36:29] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:29] [INFO ] Invariant cache hit.
[2023-03-15 23:36:30] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-15 23:36:30] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:30] [INFO ] Invariant cache hit.
[2023-03-15 23:36:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 23:36:32] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
[2023-03-15 23:36:32] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 23:36:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 23:36:32] [INFO ] Invariant cache hit.
[2023-03-15 23:36:34] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4266 ms. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 16 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-15 23:36:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 23:36:34] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:36:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 23:36:34] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:36:34] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 23:36:34] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 598726 steps, run visited all 1 properties in 2294 ms. (steps per millisecond=260 )
Probabilistic random walk after 598726 steps, saw 80460 distinct states, run finished after 2294 ms. (steps per millisecond=260 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15672104 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16161456 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="Peterson-PT-6"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Peterson-PT-6, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-smll-167863550600397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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