fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r537-tall-167987255000154
Last Updated
May 14, 2023

About the Execution of Smart+red for EisenbergMcGuire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3229.439 1800000.00 2375724.00 3858.80 [undef] Time out reached

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.r537-tall-167987255000154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is EisenbergMcGuire-PT-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 Liveness

=== Now, execution of the tool begins

BK_START 1680814196644

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-04-06 20:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:49:58] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-04-06 20:49:58] [INFO ] Transformed 414 places.
[2023-04-06 20:49:58] [INFO ] Transformed 1296 transitions.
[2023-04-06 20:49:58] [INFO ] Found NUPN structural information;
[2023-04-06 20:49:58] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 165 ms.
Built sparse matrix representations for Structural reductions in 9 ms.27353KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 88 ms. Remains 414 /414 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 89 ms. Remains : 414/414 places, 1296/1296 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 53 ms. Remains 414 /414 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-04-06 20:49:58] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 20:49:58] [INFO ] Computed 19 invariants in 23 ms
[2023-04-06 20:49:59] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-04-06 20:49:59] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2023-04-06 20:49:59] [INFO ] Invariant cache hit.
[2023-04-06 20:49:59] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:49:59] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-04-06 20:49:59] [INFO ] Redundant transitions in 75 ms returned []
[2023-04-06 20:49:59] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2023-04-06 20:49:59] [INFO ] Invariant cache hit.
[2023-04-06 20:50:00] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1596 ms. Remains : 414/414 places, 1296/1296 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1756 ms (no deadlock found). (steps per millisecond=711 )
Random directed walk for 1250006 steps, including 0 resets, run took 2017 ms (no deadlock found). (steps per millisecond=619 )
[2023-04-06 20:50:04] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2023-04-06 20:50:04] [INFO ] Invariant cache hit.
[2023-04-06 20:50:04] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-04-06 20:50:04] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 24 ms returned sat
[2023-04-06 20:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:50:04] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-04-06 20:50:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:50:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 20:50:05] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 19 ms returned sat
[2023-04-06 20:50:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:50:05] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-04-06 20:50:05] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:50:05] [INFO ] [Nat]Added 314 Read/Feed constraints in 49 ms returned sat
[2023-04-06 20:50:06] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 13 ms to minimize.
[2023-04-06 20:50:06] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 1 ms to minimize.
[2023-04-06 20:50:06] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 2 ms to minimize.
[2023-04-06 20:50:06] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2023-04-06 20:50:07] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 1 ms to minimize.
[2023-04-06 20:50:07] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-04-06 20:50:07] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2023-04-06 20:50:07] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2023-04-06 20:50:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1979 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 408 transition count 1176
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 294 transition count 1176
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 1146
Applied a total of 300 rules in 55 ms. Remains 264 /414 variables (removed 150) and now considering 1146/1296 (removed 150) transitions.
[2023-04-06 20:50:07] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-04-06 20:50:07] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 20:50:08] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-04-06 20:50:08] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 20:50:08] [INFO ] Invariant cache hit.
[2023-04-06 20:50:08] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:50:09] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2023-04-06 20:50:09] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 20:50:09] [INFO ] Invariant cache hit.
[2023-04-06 20:50:09] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 264/414 places, 1146/1296 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1721 ms. Remains : 264/414 places, 1146/1296 transitions.
Initial state reduction rules removed 6 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1287 ms. (steps per millisecond=7 ) properties (out of 1140) seen :259
Running SMT prover for 881 properties.
[2023-04-06 20:50:10] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 20:50:10] [INFO ] Invariant cache hit.
[2023-04-06 20:50:14] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:50:14] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:50:36] [INFO ] After 17648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :67 real:814
[2023-04-06 20:50:36] [INFO ] State equation strengthened by 314 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:399)
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:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-06 20:50:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 20:50:36] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 881 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 197 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1146/1146 transitions.
Applied a total of 0 rules in 26 ms. Remains 264 /264 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 264/264 places, 1146/1146 transitions.
Interrupted random walk after 418556 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 21
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 860) 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 860) 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 860) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 860) 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 860) 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 859) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 856) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 855) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 851) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 849) 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 849) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 848) 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 848) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 848) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 848) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 847) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 847) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 847) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 843) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 843) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 842) 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 842) 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 842) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 840) 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 840) 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 839) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 839) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 839) 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 839) 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 839) 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 839) 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 839) 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 839) 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 839) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) 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 838) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 838) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 838) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 837) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 837) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 837) 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 837) 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 837) 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 837) 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 837) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 837) 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 837) 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 837) 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 837) 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 837) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 837) 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 837) 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 837) 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 837) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 836) 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 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 836) 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 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 836) 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 836) 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 836) 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 836) 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 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 836) 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 836) 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 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 836) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 836) 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 836) 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 836) 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 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 835) 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 835) 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 835) 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 835) 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 835) 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 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) 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 835) 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 835) 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 835) 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 835) 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 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) 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 835) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 831) 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 831) 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 831) 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 831) 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 831) 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 831) 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 831) 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 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 831) 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 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 831) 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 830) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 830) 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 830) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) 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 829) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 827) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 826) 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 826) 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 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 826) 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 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 826) 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 826) 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 826) 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 826) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 825) 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 825) 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 825) 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 825) 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 825) 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 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) 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 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) 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 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) 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 824) 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 824) 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 824) 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 824) 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 824) 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 823) 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 823) 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 823) 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 823) 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 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 823) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 818) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 818) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 818) 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 818) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) 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 817) 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 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 817) 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 817) 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 817) 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 817) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) 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 816) 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 816) 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 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) 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 816) 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 816) 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 816) 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 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) 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 816) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 816) 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 816) 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 816) 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 816) seen :0
Probabilistic random walk after 1000001 steps, saw 402967 distinct states, run finished after 38521 ms. (steps per millisecond=25 ) properties seen :228
Running SMT prover for 588 properties.
[2023-04-06 20:51:48] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 20:51:48] [INFO ] Invariant cache hit.
[2023-04-06 20:51:51] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:51:51] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 16 ms returned sat
[2023-04-06 20:52:06] [INFO ] After 17755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:588
[2023-04-06 20:52:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:52:08] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:52:21] [INFO ] After 9911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :588
[2023-04-06 20:52:21] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 20:52:33] [INFO ] After 12550ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :0 sat :588
[2023-04-06 20:52:33] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 0 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 1 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2125 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 20:52:38] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-04-06 20:52:38] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
[2023-04-06 20:52:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-06 20:52:41] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2023-04-06 20:52:41] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:52:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-04-06 20:52:44] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 0 ms to minimize.
[2023-04-06 20:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-04-06 20:52:50] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 0 ms to minimize.
[2023-04-06 20:52:50] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2023-04-06 20:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-04-06 20:52:54] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 0 ms to minimize.
[2023-04-06 20:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-04-06 20:52:54] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 20:52:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 20:52:55] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 1 ms to minimize.
[2023-04-06 20:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 20:52:59] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2023-04-06 20:52:59] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 0 ms to minimize.
[2023-04-06 20:52:59] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 0 ms to minimize.
[2023-04-06 20:52:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2023-04-06 20:53:00] [INFO ] After 38834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :588
Attempting to minimize the solution found.
Minimization took 15099 ms.
[2023-04-06 20:53:15] [INFO ] After 68496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :588
Fused 588 Parikh solutions to 581 different solutions.
Parikh walk visited 0 properties in 2891 ms.
Support contains 123 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1146/1146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 257 transition count 1104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 257 transition count 1104
Applied a total of 14 rules in 58 ms. Remains 257 /264 variables (removed 7) and now considering 1104/1146 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 257/264 places, 1104/1146 transitions.
Interrupted random walk after 371083 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) 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 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 588) 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 588) 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 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 588) seen :0
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 25749 ms. (steps per millisecond=38 ) properties seen :14
Running SMT prover for 574 properties.
[2023-04-06 20:54:14] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
// Phase 1: matrix 510 rows 257 cols
[2023-04-06 20:54:14] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 20:54:16] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:54:16] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:54:30] [INFO ] After 15878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:574
[2023-04-06 20:54:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:54:32] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:54:43] [INFO ] After 9094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :574
[2023-04-06 20:54:43] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 20:54:54] [INFO ] After 10801ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :574
[2023-04-06 20:54:54] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 20:54:54] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 3 ms to minimize.
[2023-04-06 20:54:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1551 ms
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-04-06 20:54:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2023-04-06 20:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 20:54:57] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 20:54:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
[2023-04-06 20:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 20:54:57] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:54:57] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2023-04-06 20:54:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-04-06 20:54:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 20:54:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-04-06 20:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 20:55:01] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2023-04-06 20:55:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 20:55:02] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 0 ms to minimize.
[2023-04-06 20:55:02] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2023-04-06 20:55:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-06 20:55:11] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2023-04-06 20:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 20:55:12] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2023-04-06 20:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 20:55:14] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2023-04-06 20:55:14] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2023-04-06 20:55:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-04-06 20:55:16] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 0 ms to minimize.
[2023-04-06 20:55:16] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2023-04-06 20:55:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-06 20:55:17] [INFO ] After 33870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :574
Attempting to minimize the solution found.
Minimization took 12508 ms.
[2023-04-06 20:55:30] [INFO ] After 59855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :574
Fused 574 Parikh solutions to 570 different solutions.
Parikh walk visited 0 properties in 3419 ms.
Support contains 118 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 36 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 257/257 places, 1104/1104 transitions.
Interrupted random walk after 322319 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties 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 574) 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 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 574) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 32122 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 573 properties.
[2023-04-06 20:56:36] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 20:56:36] [INFO ] Invariant cache hit.
[2023-04-06 20:56:38] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:56:38] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:56:54] [INFO ] After 17659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:573
[2023-04-06 20:56:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 20:56:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2023-04-06 20:57:08] [INFO ] After 9286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :573
[2023-04-06 20:57:08] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 20:57:19] [INFO ] After 11529ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :573
[2023-04-06 20:57:19] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:57:19] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 0 ms to minimize.
[2023-04-06 20:57:19] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-04-06 20:57:20] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1363 ms
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-06 20:57:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:57:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 463 ms
[2023-04-06 20:57:24] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 20:57:24] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2023-04-06 20:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 20:57:25] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 0 ms to minimize.
[2023-04-06 20:57:25] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2023-04-06 20:57:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-04-06 20:57:26] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2023-04-06 20:57:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-06 20:57:29] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2023-04-06 20:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-06 20:57:32] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 20:57:34] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2023-04-06 20:57:34] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2023-04-06 20:57:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 853 ms
[2023-04-06 20:57:36] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2023-04-06 20:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-06 20:57:38] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2023-04-06 20:57:38] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2023-04-06 20:57:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 20:57:40] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 0 ms to minimize.
[2023-04-06 20:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-06 20:57:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-04-06 20:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 20:57:44] [INFO ] After 35917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :573
Attempting to minimize the solution found.
Minimization took 13816 ms.
[2023-04-06 20:57:57] [INFO ] After 63558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :573
Fused 573 Parikh solutions to 565 different solutions.
Parikh walk visited 0 properties in 2652 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 27 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 257/257 places, 1104/1104 transitions.
Interrupted random walk after 439723 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) 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 573) 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 573) 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 573) 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 573) 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 573) 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 573) 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 573) 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 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 573) 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 573) 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 573) 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 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 573) 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 573) 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 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 573) seen :0
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 24938 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 573 properties.
[2023-04-06 20:58:56] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 20:58:56] [INFO ] Invariant cache hit.
[2023-04-06 20:58:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 20:58:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 20:59:14] [INFO ] After 17798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:573
[2023-04-06 20:59:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 20:59:16] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 20:59:27] [INFO ] After 9230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :573
[2023-04-06 20:59:27] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 20:59:39] [INFO ] After 11820ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :573
[2023-04-06 20:59:39] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-06 20:59:39] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2023-04-06 20:59:39] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1273 ms
[2023-04-06 20:59:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 20:59:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2023-04-06 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 20:59:41] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-04-06 20:59:42] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:59:42] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:59:42] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:59:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:59:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 427 ms
[2023-04-06 20:59:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 20:59:44] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 0 ms to minimize.
[2023-04-06 20:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-06 20:59:45] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 0 ms to minimize.
[2023-04-06 20:59:45] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2023-04-06 20:59:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2023-04-06 20:59:46] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2023-04-06 20:59:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-06 20:59:49] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:59:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 20:59:52] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-06 20:59:54] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 0 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 0 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2023-04-06 20:59:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 805 ms
[2023-04-06 20:59:56] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2023-04-06 20:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 20:59:58] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2023-04-06 20:59:58] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2023-04-06 20:59:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-06 21:00:00] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:00:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 21:00:03] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 21:00:04] [INFO ] After 36485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :573
Attempting to minimize the solution found.
Minimization took 14648 ms.
[2023-04-06 21:00:18] [INFO ] After 64818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :573
Fused 573 Parikh solutions to 565 different solutions.
Parikh walk visited 0 properties in 2361 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 25 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 257/257 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 24 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2023-04-06 21:00:21] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:00:21] [INFO ] Invariant cache hit.
[2023-04-06 21:00:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-04-06 21:00:21] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:00:21] [INFO ] Invariant cache hit.
[2023-04-06 21:00:21] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:00:21] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-04-06 21:00:21] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 21:00:21] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:00:21] [INFO ] Invariant cache hit.
[2023-04-06 21:00:22] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 854 ms. Remains : 257/257 places, 1104/1104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2665 ms. (steps per millisecond=37 ) properties (out of 117) seen :68
Running SMT prover for 49 properties.
[2023-04-06 21:00:24] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:00:24] [INFO ] Invariant cache hit.
[2023-04-06 21:00:24] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:00:24] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:00:25] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :49
[2023-04-06 21:00:25] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:00:25] [INFO ] After 149ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :49
[2023-04-06 21:00:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:00:26] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-06 21:00:26] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:00:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-06 21:00:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 21:00:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:00:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:00:27] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 21:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:00:27] [INFO ] After 2510ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-06 21:00:27] [INFO ] After 2722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-06 21:00:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:00:27] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 21:00:27] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-04-06 21:00:27] [INFO ] After 170ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 498 ms
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2023-04-06 21:00:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 21:00:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 21:00:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-06 21:00:29] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 21:00:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-04-06 21:00:31] [INFO ] After 3353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-04-06 21:00:31] [INFO ] After 3776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Interrupted random walk after 460764 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) 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 573) 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 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) 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 573) 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 573) 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 573) 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 573) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 573) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 29751 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 572 properties.
[2023-04-06 21:01:31] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:01:31] [INFO ] Invariant cache hit.
[2023-04-06 21:01:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 21:01:34] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 21:01:48] [INFO ] After 16980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:572
[2023-04-06 21:01:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 21:01:51] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 21:02:02] [INFO ] After 9497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :572
[2023-04-06 21:02:02] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:02:14] [INFO ] After 11988ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :572
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:02:15] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1455 ms
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-04-06 21:02:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:02:17] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 21:02:18] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:02:18] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 0 ms to minimize.
[2023-04-06 21:02:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-04-06 21:02:19] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:02:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:02:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-04-06 21:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:02:20] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:02:24] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:02:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:02:25] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2023-04-06 21:02:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:02:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:02:26] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 21:02:28] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:02:28] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:02:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-04-06 21:02:29] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:02:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:02:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:02:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2023-04-06 21:02:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-04-06 21:02:37] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:02:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:02:38] [INFO ] After 35163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :572
Attempting to minimize the solution found.
Minimization took 14143 ms.
[2023-04-06 21:02:52] [INFO ] After 63265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :572
Fused 572 Parikh solutions to 555 different solutions.
Parikh walk visited 0 properties in 2419 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 32 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 257/257 places, 1104/1104 transitions.
Interrupted random walk after 449016 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) 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 572) seen :0
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 30683 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 572 properties.
[2023-04-06 21:03:55] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:03:55] [INFO ] Invariant cache hit.
[2023-04-06 21:03:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 21:03:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 21:04:13] [INFO ] After 17647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:572
[2023-04-06 21:04:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 21:04:15] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 10 ms returned sat
[2023-04-06 21:04:27] [INFO ] After 9320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :572
[2023-04-06 21:04:27] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:04:39] [INFO ] After 12300ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :572
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 14 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1637 ms
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:04:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:04:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 21:04:49] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:04:51] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2023-04-06 21:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 21:04:54] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:04:54] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 0 ms to minimize.
[2023-04-06 21:04:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-04-06 21:04:54] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:05:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:05:00] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:05:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-04-06 21:05:03] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 21:05:03] [INFO ] After 36313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :572
Attempting to minimize the solution found.
Minimization took 13903 ms.
[2023-04-06 21:05:17] [INFO ] After 64107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :572
Fused 572 Parikh solutions to 555 different solutions.
Parikh walk visited 0 properties in 2320 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 22 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 257/257 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 21 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2023-04-06 21:05:20] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:05:20] [INFO ] Invariant cache hit.
[2023-04-06 21:05:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-04-06 21:05:20] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:05:20] [INFO ] Invariant cache hit.
[2023-04-06 21:05:20] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:05:20] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-04-06 21:05:20] [INFO ] Redundant transitions in 55 ms returned []
[2023-04-06 21:05:20] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:05:20] [INFO ] Invariant cache hit.
[2023-04-06 21:05:21] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 257/257 places, 1104/1104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2261 ms. (steps per millisecond=44 ) properties (out of 117) seen :68
Running SMT prover for 49 properties.
[2023-04-06 21:05:23] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:05:23] [INFO ] Invariant cache hit.
[2023-04-06 21:05:23] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:23] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:23] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :49
[2023-04-06 21:05:23] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:05:23] [INFO ] After 156ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :49
[2023-04-06 21:05:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:05:24] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-04-06 21:05:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 21:05:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 21:05:25] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:05:25] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:05:26] [INFO ] After 2527ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-06 21:05:26] [INFO ] After 2746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-06 21:05:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:26] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:26] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-04-06 21:05:26] [INFO ] After 194ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2023-04-06 21:05:26] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:05:26] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:05:26] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:05:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:05:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 560 ms
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-04-06 21:05:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:05:28] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:05:28] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-04-06 21:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 21:05:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 21:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 21:05:28] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-04-06 21:05:29] [INFO ] After 3161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-04-06 21:05:29] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=121 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 214 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 270 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 174 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 317 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 353 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=176 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 383 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=191 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 327 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=163 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 386 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=193 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 213 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=213 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 313 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=156 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 533 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 308 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=154 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 377 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=188 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 150 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 449 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=224 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 109 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 187 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=187 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 275 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=275 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 147 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=147 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 285 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=142 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 468 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=234 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3364 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=420 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 225 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=225 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 262 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=262 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 357 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 424 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=212 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 176832 steps, run visited all 1 properties in 700 ms. (steps per millisecond=252 )
Probabilistic random walk after 176832 steps, saw 93205 distinct states, run finished after 701 ms. (steps per millisecond=252 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 151387 steps, run visited all 1 properties in 615 ms. (steps per millisecond=246 )
Probabilistic random walk after 151387 steps, saw 81641 distinct states, run finished after 615 ms. (steps per millisecond=246 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 73652 steps, run visited all 1 properties in 297 ms. (steps per millisecond=247 )
Probabilistic random walk after 73652 steps, saw 45777 distinct states, run finished after 298 ms. (steps per millisecond=247 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 6271 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=482 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 9083 steps, including 2 resets, run visited all 1 properties in 20 ms. (steps per millisecond=454 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 95 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 458827 steps, run visited all 1 properties in 1790 ms. (steps per millisecond=256 )
Probabilistic random walk after 458827 steps, saw 196790 distinct states, run finished after 1791 ms. (steps per millisecond=256 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20214 steps, run visited all 1 properties in 85 ms. (steps per millisecond=237 )
Probabilistic random walk after 20214 steps, saw 14210 distinct states, run finished after 86 ms. (steps per millisecond=235 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 26045 steps, run visited all 1 properties in 109 ms. (steps per millisecond=238 )
Probabilistic random walk after 26045 steps, saw 17996 distinct states, run finished after 110 ms. (steps per millisecond=236 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 234344 steps, run visited all 1 properties in 918 ms. (steps per millisecond=255 )
Probabilistic random walk after 234344 steps, saw 116671 distinct states, run finished after 918 ms. (steps per millisecond=255 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 62424 steps, run visited all 1 properties in 256 ms. (steps per millisecond=243 )
Probabilistic random walk after 62424 steps, saw 39836 distinct states, run finished after 256 ms. (steps per millisecond=243 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 186 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 30805 steps, run visited all 1 properties in 130 ms. (steps per millisecond=236 )
Probabilistic random walk after 30805 steps, saw 21018 distinct states, run finished after 130 ms. (steps per millisecond=236 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7943 steps, run visited all 1 properties in 36 ms. (steps per millisecond=220 )
Probabilistic random walk after 7943 steps, saw 5821 distinct states, run finished after 36 ms. (steps per millisecond=220 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 64146 steps, run visited all 1 properties in 261 ms. (steps per millisecond=245 )
Probabilistic random walk after 64146 steps, saw 40629 distinct states, run finished after 261 ms. (steps per millisecond=245 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 86476 steps, run visited all 1 properties in 345 ms. (steps per millisecond=250 )
Probabilistic random walk after 86476 steps, saw 52088 distinct states, run finished after 345 ms. (steps per millisecond=250 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33416 steps, run visited all 1 properties in 139 ms. (steps per millisecond=240 )
Probabilistic random walk after 33416 steps, saw 22593 distinct states, run finished after 139 ms. (steps per millisecond=240 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 2385 steps, run visited all 1 properties in 13 ms. (steps per millisecond=183 )
Probabilistic random walk after 2385 steps, saw 1894 distinct states, run finished after 13 ms. (steps per millisecond=183 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1797 steps, run visited all 1 properties in 10 ms. (steps per millisecond=179 )
Probabilistic random walk after 1797 steps, saw 1428 distinct states, run finished after 10 ms. (steps per millisecond=179 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 762307 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 762307 steps, saw 281460 distinct states, run finished after 3002 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:39] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2023-04-06 21:05:39] [INFO ] Invariant cache hit.
[2023-04-06 21:05:39] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:39] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:39] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:39] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:39] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:05:39] [INFO ] After 45ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 21:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 21:05:39] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 21:05:39] [INFO ] After 321ms 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 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 966
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 966
Applied a total of 46 rules in 32 ms. Remains 234 /257 variables (removed 23) and now considering 966/1104 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/257 places, 966/1104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 865543 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 865543 steps, saw 207259 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:42] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 21:05:42] [INFO ] Computed 19 invariants in 8 ms
[2023-04-06 21:05:42] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:42] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-06 21:05:42] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 21:05:42] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:42] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:42] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 21:05:42] [INFO ] After 29ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 21:05:42] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 21:05:42] [INFO ] After 257ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 21:05:43] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:43] [INFO ] Invariant cache hit.
[2023-04-06 21:05:43] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-04-06 21:05:43] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:43] [INFO ] Invariant cache hit.
[2023-04-06 21:05:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 21:05:43] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-04-06 21:05:43] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 21:05:43] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:43] [INFO ] Invariant cache hit.
[2023-04-06 21:05:44] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 283 place count 74 transition count 136
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 74 transition count 130
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 327 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 358 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 364 place count 43 transition count 92
Applied a total of 364 rules in 25 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 92 rows 43 cols
[2023-04-06 21:05:44] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 21:05:44] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 21:05:44] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:05:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 21:05:44] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:44] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 21:05:44] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:44] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:44] [INFO ] After 7ms 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-04-06 21:05:44] [INFO ] After 50ms 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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 120699 steps, run visited all 1 properties in 497 ms. (steps per millisecond=242 )
Probabilistic random walk after 120699 steps, saw 67433 distinct states, run finished after 497 ms. (steps per millisecond=242 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31834 steps, run visited all 1 properties in 133 ms. (steps per millisecond=239 )
Probabilistic random walk after 31834 steps, saw 21597 distinct states, run finished after 133 ms. (steps per millisecond=239 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 81275 steps, run visited all 1 properties in 334 ms. (steps per millisecond=243 )
Probabilistic random walk after 81275 steps, saw 49674 distinct states, run finished after 334 ms. (steps per millisecond=243 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1090 steps, run visited all 1 properties in 8 ms. (steps per millisecond=136 )
Probabilistic random walk after 1090 steps, saw 894 distinct states, run finished after 8 ms. (steps per millisecond=136 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 600 steps, run visited all 1 properties in 5 ms. (steps per millisecond=120 )
Probabilistic random walk after 600 steps, saw 503 distinct states, run finished after 5 ms. (steps per millisecond=120 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24883 steps, run visited all 1 properties in 100 ms. (steps per millisecond=248 )
Probabilistic random walk after 24883 steps, saw 17187 distinct states, run finished after 101 ms. (steps per millisecond=246 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13375 steps, run visited all 1 properties in 67 ms. (steps per millisecond=199 )
Probabilistic random walk after 13375 steps, saw 9651 distinct states, run finished after 67 ms. (steps per millisecond=199 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7334 steps, run visited all 1 properties in 33 ms. (steps per millisecond=222 )
Probabilistic random walk after 7334 steps, saw 5414 distinct states, run finished after 33 ms. (steps per millisecond=222 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10512 steps, run visited all 1 properties in 44 ms. (steps per millisecond=238 )
Probabilistic random walk after 10512 steps, saw 7591 distinct states, run finished after 44 ms. (steps per millisecond=238 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4358 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=484 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 140 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 216 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 355 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 354 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 156 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=156 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 233 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=233 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 324 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=162 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 401 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 479 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=239 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 796117 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796117 steps, saw 292018 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:48] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
// Phase 1: matrix 510 rows 257 cols
[2023-04-06 21:05:48] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 21:05:48] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:48] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:48] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:05:48] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-04-06 21:05:48] [INFO ] After 40ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:48] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:49] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:49] [INFO ] After 42ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 21:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 21:05:49] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 21:05:49] [INFO ] After 302ms 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 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 966
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 966
Applied a total of 46 rules in 25 ms. Remains 234 /257 variables (removed 23) and now considering 966/1104 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 234/257 places, 966/1104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 876680 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 876680 steps, saw 209701 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 21:05:52] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 21:05:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:52] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:05:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 21:05:52] [INFO ] After 30ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:52] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-06 21:05:52] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:52] [INFO ] After 29ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:52] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 21:05:52] [INFO ] After 210ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 21:05:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:52] [INFO ] Invariant cache hit.
[2023-04-06 21:05:52] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-06 21:05:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:52] [INFO ] Invariant cache hit.
[2023-04-06 21:05:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 21:05:53] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-04-06 21:05:53] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-06 21:05:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 21:05:53] [INFO ] Invariant cache hit.
[2023-04-06 21:05:53] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1110 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 880 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 204 transition count 235
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 157 transition count 235
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 157 transition count 222
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 138 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 275 place count 79 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 289 place count 72 transition count 152
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 295 place count 72 transition count 146
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 72 transition count 140
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 72 transition count 115
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 351 place count 47 transition count 115
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 361 place count 47 transition count 115
Applied a total of 361 rules in 18 ms. Remains 47 /234 variables (removed 187) and now considering 115/966 (removed 851) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 47 cols
[2023-04-06 21:05:53] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 21:05:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 21:05:53] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:05:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 21:05:53] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:53] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 21:05:53] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:53] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:53] [INFO ] After 7ms 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-04-06 21:05:53] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 277 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 193 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 201 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 321 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 336 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=336 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 416 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9889 steps, run visited all 1 properties in 43 ms. (steps per millisecond=229 )
Probabilistic random walk after 9889 steps, saw 7106 distinct states, run finished after 43 ms. (steps per millisecond=229 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10092 steps, run visited all 1 properties in 43 ms. (steps per millisecond=234 )
Probabilistic random walk after 10092 steps, saw 7256 distinct states, run finished after 44 ms. (steps per millisecond=229 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10099 steps, run visited all 1 properties in 59 ms. (steps per millisecond=171 )
Probabilistic random walk after 10099 steps, saw 7262 distinct states, run finished after 59 ms. (steps per millisecond=171 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10106 steps, run visited all 1 properties in 44 ms. (steps per millisecond=229 )
Probabilistic random walk after 10106 steps, saw 7268 distinct states, run finished after 45 ms. (steps per millisecond=224 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11800 steps, run visited all 1 properties in 51 ms. (steps per millisecond=231 )
Probabilistic random walk after 11800 steps, saw 8525 distinct states, run finished after 51 ms. (steps per millisecond=231 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11779 steps, run visited all 1 properties in 50 ms. (steps per millisecond=235 )
Probabilistic random walk after 11779 steps, saw 8507 distinct states, run finished after 51 ms. (steps per millisecond=230 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11786 steps, run visited all 1 properties in 50 ms. (steps per millisecond=235 )
Probabilistic random walk after 11786 steps, saw 8513 distinct states, run finished after 50 ms. (steps per millisecond=235 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11793 steps, run visited all 1 properties in 49 ms. (steps per millisecond=240 )
Probabilistic random walk after 11793 steps, saw 8519 distinct states, run finished after 49 ms. (steps per millisecond=240 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5031 steps, run visited all 1 properties in 29 ms. (steps per millisecond=173 )
Probabilistic random walk after 5031 steps, saw 3718 distinct states, run finished after 29 ms. (steps per millisecond=173 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5038 steps, run visited all 1 properties in 24 ms. (steps per millisecond=209 )
Probabilistic random walk after 5038 steps, saw 3724 distinct states, run finished after 24 ms. (steps per millisecond=209 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5017 steps, run visited all 1 properties in 23 ms. (steps per millisecond=218 )
Probabilistic random walk after 5017 steps, saw 3706 distinct states, run finished after 23 ms. (steps per millisecond=218 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5024 steps, run visited all 1 properties in 22 ms. (steps per millisecond=228 )
Probabilistic random walk after 5024 steps, saw 3712 distinct states, run finished after 23 ms. (steps per millisecond=218 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1482 steps, run visited all 1 properties in 8 ms. (steps per millisecond=185 )
Probabilistic random walk after 1482 steps, saw 1177 distinct states, run finished after 9 ms. (steps per millisecond=164 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1489 steps, run visited all 1 properties in 8 ms. (steps per millisecond=186 )
Probabilistic random walk after 1489 steps, saw 1183 distinct states, run finished after 9 ms. (steps per millisecond=165 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1496 steps, run visited all 1 properties in 13 ms. (steps per millisecond=115 )
Probabilistic random walk after 1496 steps, saw 1189 distinct states, run finished after 13 ms. (steps per millisecond=115 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1475 steps, run visited all 1 properties in 9 ms. (steps per millisecond=163 )
Probabilistic random walk after 1475 steps, saw 1171 distinct states, run finished after 10 ms. (steps per millisecond=147 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 411 steps, run visited all 1 properties in 5 ms. (steps per millisecond=82 )
Probabilistic random walk after 411 steps, saw 345 distinct states, run finished after 5 ms. (steps per millisecond=82 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 418 steps, run visited all 1 properties in 5 ms. (steps per millisecond=83 )
Probabilistic random walk after 418 steps, saw 351 distinct states, run finished after 5 ms. (steps per millisecond=83 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 425 steps, run visited all 1 properties in 5 ms. (steps per millisecond=85 )
Probabilistic random walk after 425 steps, saw 357 distinct states, run finished after 5 ms. (steps per millisecond=85 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 432 steps, run visited all 1 properties in 5 ms. (steps per millisecond=86 )
Probabilistic random walk after 432 steps, saw 363 distinct states, run finished after 5 ms. (steps per millisecond=86 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 124 steps, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Probabilistic random walk after 124 steps, saw 109 distinct states, run finished after 7 ms. (steps per millisecond=17 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 131 steps, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Probabilistic random walk after 131 steps, saw 115 distinct states, run finished after 5 ms. (steps per millisecond=26 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 155 edges and 257 vertex of which 13 / 257 are part of one of the 6 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions removed 22 transitions
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 618 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 250 transition count 475
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 28 place count 239 transition count 470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 234 transition count 470
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 234 transition count 468
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 232 transition count 468
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 230 transition count 466
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 224 transition count 572
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 165 place count 224 transition count 460
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 222 place count 224 transition count 403
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 224 transition count 378
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 272 place count 199 transition count 378
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 199 transition count 378
Applied a total of 273 rules in 30 ms. Remains 199 /257 variables (removed 58) and now considering 378/1104 (removed 726) transitions.
Running SMT prover for 572 properties.
// Phase 1: matrix 378 rows 199 cols
[2023-04-06 21:05:55] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 21:05:57] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:05:57] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:06:07] [INFO ] After 12523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:572
[2023-04-06 21:06:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 21:06:09] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2023-04-06 21:06:18] [INFO ] After 7034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :572
[2023-04-06 21:06:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-04-06 21:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 21:06:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-06 21:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-06 21:06:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 21:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-04-06 21:06:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 21:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 21:06:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-04-06 21:06:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-04-06 21:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-04-06 21:06:30] [INFO ] After 19142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :572
Attempting to minimize the solution found.
Minimization took 6994 ms.
[2023-04-06 21:06:37] [INFO ] After 29766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :572
Unable to solve all queries for examination QuasiLiveness. Remains :572 assertions to prove.
Starting structural reductions in LIVENESS mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 408 transition count 1176
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 294 transition count 1176
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 1146
Applied a total of 300 rules in 21 ms. Remains 264 /414 variables (removed 150) and now considering 1146/1296 (removed 150) transitions.
[2023-04-06 21:06:37] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
// Phase 1: matrix 552 rows 264 cols
[2023-04-06 21:06:37] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 21:06:37] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-04-06 21:06:37] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 21:06:37] [INFO ] Invariant cache hit.
[2023-04-06 21:06:38] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 21:06:38] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2023-04-06 21:06:38] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2023-04-06 21:06:38] [INFO ] Invariant cache hit.
[2023-04-06 21:06:39] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 264/414 places, 1146/1296 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1531 ms. Remains : 264/414 places, 1146/1296 transitions.
Unable to solve all queries for examination Liveness. Remains :1146 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1146 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1000905 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 06
Examination Liveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Liveness.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 414 places, 1296 transitions, 5976 arcs.
(potential((tk(P25)>=1) & (tk(P7)>=1)))
(potential((tk(P25)>=1) & (tk(P9)>=1)))
(potential((tk(P26)>=1) & (tk(P10)>=1)))
(potential((tk(P26)>=1) & (tk(P12)>=1)))
(potential((tk(P27)>=1) & (tk(P13)>=1)))
(potential((tk(P27)>=1) & (tk(P15)>=1)))
(potential((tk(P28)>=1) & (tk(P16)>=1)))
(potential((tk(P28)>=1) & (tk(P18)>=1)))
(potential((tk(P29)>=1) & (tk(P19)>=1)))
(potential((tk(P29)>=1) & (tk(P21)>=1)))
(potential((tk(P30)>=1) & (tk(P22)>=1)))
(potential((tk(P30)>=1) & (tk(P24)>=1)))
(potential((tk(P31)>=1) & (tk(P1)>=1)))
(potential((tk(P31)>=1) & (tk(P2)>=1)))
(potential((tk(P31)>=1) & (tk(P3)>=1)))
(potential((tk(P31)>=1) & (tk(P4)>=1)))
(potential((tk(P31)>=1) & (tk(P5)>=1)))
(potential((tk(P31)>=1) & (tk(P6)>=1)))
(potential((tk(P32)>=1) & (tk(P1)>=1)))
(potential((tk(P32)>=1) & (tk(P2)>=1)))
(potential((tk(P32)>=1) & (tk(P3)>=1)))
(potential((tk(P32)>=1) & (tk(P4)>=1)))
(potential((tk(P32)>=1) & (tk(P5)>=1)))
(potential((tk(P32)>=1) & (tk(P6)>=1)))
(potential((tk(P33)>=1) & (tk(P1)>=1)))
(potential((tk(P33)>=1) & (tk(P2)>=1)))
(potential((tk(P33)>=1) & (tk(P3)>=1)))
(potential((tk(P33)>=1) & (tk(P4)>=1)))
(potential((tk(P33)>=1) & (tk(P5)>=1)))
(potential((tk(P33)>=1) & (tk(P6)>=1)))
(potential((tk(P34)>=1) & (tk(P1)>=1)))
(potential((tk(P34)>=1) & (tk(P2)>=1)))
(potential((tk(P34)>=1) & (tk(P3)>=1)))
(potential((tk(P34)>=1) & (tk(P4)>=1)))
(potential((tk(P34)>=1) & (tk(P5)>=1)))
(potential((tk(P34)>=1) & (tk(P6)>=1)))
(potential((tk(P35)>=1) & (tk(P1)>=1)))
(potential((tk(P35)>=1) & (tk(P2)>=1)))
(potential((tk(P35)>=1) & (tk(P3)>=1)))
(potential((tk(P35)>=1) & (tk(P4)>=1)))
(potential((tk(P35)>=1) & (tk(P5)>=1)))
(potential((tk(P35)>=1) & (tk(P6)>=1)))
(potential((tk(P36)>=1) & (tk(P1)>=1)))
(potential((tk(P36)>=1) & (tk(P2)>=1)))
(potential((tk(P36)>=1) & (tk(P3)>=1)))
(potential((tk(P36)>=1) & (tk(P4)>=1)))
(potential((tk(P36)>=1) & (tk(P5)>=1)))
(potential((tk(P36)>=1) & (tk(P6)>=1)))
(potential((tk(P38)>=1)))
(potential((tk(P39)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P41)>=1)))
(potential((tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P46)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P49)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P53)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P55)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P60)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P62)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P64)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P67)>=1)))
(potential((tk(P68)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P71)>=1)))
(potential((tk(P37)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P73)>=1) & (tk(P11)>=1)))
(potential((tk(P73)>=1) & (tk(P12)>=1)))
(potential((tk(P74)>=1) & (tk(P14)>=1)))
(potential((tk(P74)>=1) & (tk(P15)>=1)))
(potential((tk(P75)>=1) & (tk(P17)>=1)))
(potential((tk(P75)>=1) & (tk(P18)>=1)))
(potential((tk(P76)>=1) & (tk(P20)>=1)))
(potential((tk(P76)>=1) & (tk(P21)>=1)))
(potential((tk(P77)>=1) & (tk(P23)>=1)))
(potential((tk(P77)>=1) & (tk(P24)>=1)))
(potential((tk(P78)>=1) & (tk(P8)>=1)))
(potential((tk(P78)>=1) & (tk(P9)>=1)))
(potential((tk(P79)>=1) & (tk(P14)>=1)))
(potential((tk(P79)>=1) & (tk(P15)>=1)))
(potential((tk(P80)>=1) & (tk(P17)>=1)))
(potential((tk(P80)>=1) & (tk(P18)>=1)))
(potential((tk(P81)>=1) & (tk(P20)>=1)))
(potential((tk(P81)>=1) & (tk(P21)>=1)))
(potential((tk(P82)>=1) & (tk(P23)>=1)))
(potential((tk(P82)>=1) & (tk(P24)>=1)))
(potential((tk(P83)>=1) & (tk(P8)>=1)))
(potential((tk(P83)>=1) & (tk(P9)>=1)))
(potential((tk(P84)>=1) & (tk(P11)>=1)))
(potential((tk(P84)>=1) & (tk(P12)>=1)))
(potential((tk(P85)>=1) & (tk(P17)>=1)))
(potential((tk(P85)>=1) & (tk(P18)>=1)))
(potential((tk(P86)>=1) & (tk(P20)>=1)))
(potential((tk(P86)>=1) & (tk(P21)>=1)))
(potential((tk(P87)>=1) & (tk(P23)>=1)))
(potential((tk(P87)>=1) & (tk(P24)>=1)))
(potential((tk(P88)>=1) & (tk(P8)>=1)))
(potential((tk(P88)>=1) & (tk(P9)>=1)))
(potential((tk(P89)>=1) & (tk(P11)>=1)))
(potential((tk(P89)>=1) & (tk(P12)>=1)))
(potential((tk(P90)>=1) & (tk(P14)>=1)))
(potential((tk(P90)>=1) & (tk(P15)>=1)))
(potential((tk(P91)>=1) & (tk(P20)>=1)))
(potential((tk(P91)>=1) & (tk(P21)>=1)))
(potential((tk(P92)>=1) & (tk(P23)>=1)))
(potential((tk(P92)>=1) & (tk(P24)>=1)))
(potential((tk(P93)>=1) & (tk(P8)>=1)))
(potential((tk(P93)>=1) & (tk(P9)>=1)))
(potential((tk(P94)>=1) & (tk(P11)>=1)))
(potential((tk(P94)>=1) & (tk(P12)>=1)))
(potential((tk(P95)>=1) & (tk(P14)>=1)))
(potential((tk(P95)>=1) & (tk(P15)>=1)))
(potential((tk(P96)>=1) & (tk(P17)>=1)))
(potential((tk(P96)>=1) & (tk(P18)>=1)))
(potential((tk(P97)>=1) & (tk(P23)>=1)))
(potential((tk(P97)>=1) & (tk(P24)>=1)))
(potential((tk(P98)>=1) & (tk(P8)>=1)))
(potential((tk(P98)>=1) & (tk(P9)>=1)))
(potential((tk(P99)>=1) & (tk(P11)>=1)))
(potential((tk(P99)>=1) & (tk(P12)>=1)))
(potential((tk(P100)>=1) & (tk(P14)>=1)))
(potential((tk(P100)>=1) & (tk(P15)>=1)))
(potential((tk(P101)>=1) & (tk(P17)>=1)))
(potential((tk(P101)>=1) & (tk(P18)>=1)))
(potential((tk(P102)>=1) & (tk(P20)>=1)))
(potential((tk(P102)>=1) & (tk(P21)>=1)))
(potential((tk(P73)>=1) & (tk(P10)>=1)))
(potential((tk(P74)>=1) & (tk(P13)>=1)))
(potential((tk(P75)>=1) & (tk(P16)>=1)))
(potential((tk(P76)>=1) & (tk(P19)>=1)))
(potential((tk(P77)>=1) & (tk(P22)>=1)))
(potential((tk(P78)>=1) & (tk(P7)>=1)))
(potential((tk(P79)>=1) & (tk(P13)>=1)))
(potential((tk(P80)>=1) & (tk(P16)>=1)))
(potential((tk(P81)>=1) & (tk(P19)>=1)))
(potential((tk(P82)>=1) & (tk(P22)>=1)))
(potential((tk(P83)>=1) & (tk(P7)>=1)))
(potential((tk(P84)>=1) & (tk(P10)>=1)))
(potential((tk(P85)>=1) & (tk(P16)>=1)))
(potential((tk(P86)>=1) & (tk(P19)>=1)))
(potential((tk(P87)>=1) & (tk(P22)>=1)))
(potential((tk(P88)>=1) & (tk(P7)>=1)))
(potential((tk(P89)>=1) & (tk(P10)>=1)))
(potential((tk(P90)>=1) & (tk(P13)>=1)))
(potential((tk(P91)>=1) & (tk(P19)>=1)))
(potential((tk(P92)>=1) & (tk(P22)>=1)))
(potential((tk(P93)>=1) & (tk(P7)>=1)))
(potential((tk(P94)>=1) & (tk(P10)>=1)))
(potential((tk(P95)>=1) & (tk(P13)>=1)))
(potential((tk(P96)>=1) & (tk(P16)>=1)))
(potential((tk(P97)>=1) & (tk(P22)>=1)))
(potential((tk(P98)>=1) & (tk(P7)>=1)))
(potential((tk(P99)>=1) & (tk(P10)>=1)))
(potential((tk(P100)>=1) & (tk(P13)>=1)))
(potential((tk(P101)>=1) & (tk(P16)>=1)))
(potential((tk(P102)>=1) & (tk(P19)>=1)))
(potential((tk(P103)>=1) & (tk(P1)>=1)))
(potential((tk(P103)>=1) & (tk(P2)>=1)))
(potential((tk(P103)>=1) & (tk(P3)>=1)))
(potential((tk(P103)>=1) & (tk(P4)>=1)))
(potential((tk(P103)>=1) & (tk(P5)>=1)))
(potential((tk(P103)>=1) & (tk(P6)>=1)))
(potential((tk(P104)>=1) & (tk(P1)>=1)))
(potential((tk(P104)>=1) & (tk(P2)>=1)))
(potential((tk(P104)>=1) & (tk(P3)>=1)))
(potential((tk(P104)>=1) & (tk(P4)>=1)))
(potential((tk(P104)>=1) & (tk(P5)>=1)))
(potential((tk(P104)>=1) & (tk(P6)>=1)))
(potential((tk(P105)>=1) & (tk(P1)>=1)))
(potential((tk(P105)>=1) & (tk(P2)>=1)))
(potential((tk(P105)>=1) & (tk(P3)>=1)))
(potential((tk(P105)>=1) & (tk(P4)>=1)))
(potential((tk(P105)>=1) & (tk(P5)>=1)))
(potential((tk(P105)>=1) & (tk(P6)>=1)))
(potential((tk(P106)>=1) & (tk(P1)>=1)))
(potential((tk(P106)>=1) & (tk(P2)>=1)))
(potential((tk(P106)>=1) & (tk(P3)>=1)))
(potential((tk(P106)>=1) & (tk(P4)>=1)))
(potential((tk(P106)>=1) & (tk(P5)>=1)))
(potential((tk(P106)>=1) & (tk(P6)>=1)))
(potential((tk(P107)>=1) & (tk(P1)>=1)))
(potential((tk(P107)>=1) & (tk(P2)>=1)))
(potential((tk(P107)>=1) & (tk(P3)>=1)))
(potential((tk(P107)>=1) & (tk(P4)>=1)))
(potential((tk(P107)>=1) & (tk(P5)>=1)))
(potential((tk(P107)>=1) & (tk(P6)>=1)))
(potential((tk(P108)>=1) & (tk(P1)>=1)))
(potential((tk(P108)>=1) & (tk(P2)>=1)))
(potential((tk(P108)>=1) & (tk(P3)>=1)))
(potential((tk(P108)>=1) & (tk(P4)>=1)))
(potential((tk(P108)>=1) & (tk(P5)>=1)))
(potential((tk(P108)>=1) & (tk(P6)>=1)))
(potential((tk(P109)>=1) & (tk(P1)>=1)))
(potential((tk(P109)>=1) & (tk(P2)>=1)))
(potential((tk(P109)>=1) & (tk(P3)>=1)))
(potential((tk(P109)>=1) & (tk(P4)>=1)))
(potential((tk(P109)>=1) & (tk(P5)>=1)))
(potential((tk(P109)>=1) & (tk(P6)>=1)))
(potential((tk(P110)>=1) & (tk(P1)>=1)))
(potential((tk(P110)>=1) & (tk(P2)>=1)))
(potential((tk(P110)>=1) & (tk(P3)>=1)))
(potential((tk(P110)>=1) & (tk(P4)>=1)))
(potential((tk(P110)>=1) & (tk(P5)>=1)))
(potential((tk(P110)>=1) & (tk(P6)>=1)))
(potential((tk(P111)>=1) & (tk(P1)>=1)))
(potential((tk(P111)>=1) & (tk(P2)>=1)))
(potential((tk(P111)>=1) & (tk(P3)>=1)))
(potential((tk(P111)>=1) & (tk(P4)>=1)))
(potential((tk(P111)>=1) & (tk(P5)>=1)))
(potential((tk(P111)>=1) & (tk(P6)>=1)))
(potential((tk(P112)>=1) & (tk(P1)>=1)))
(potential((tk(P112)>=1) & (tk(P2)>=1)))
(potential((tk(P112)>=1) & (tk(P3)>=1)))
(potential((tk(P112)>=1) & (tk(P4)>=1)))
(potential((tk(P112)>=1) & (tk(P5)>=1)))
(potential((tk(P112)>=1) & (tk(P6)>=1)))
(potential((tk(P113)>=1) & (tk(P1)>=1)))
(potential((tk(P113)>=1) & (tk(P2)>=1)))
(potential((tk(P113)>=1) & (tk(P3)>=1)))
(potential((tk(P113)>=1) & (tk(P4)>=1)))
(potential((tk(P113)>=1) & (tk(P5)>=1)))
(potential((tk(P113)>=1) & (tk(P6)>=1)))
(potential((tk(P114)>=1) & (tk(P1)>=1)))
(potential((tk(P114)>=1) & (tk(P2)>=1)))
(potential((tk(P114)>=1) & (tk(P3)>=1)))
(potential((tk(P114)>=1) & (tk(P4)>=1)))
(potential((tk(P114)>=1) & (tk(P5)>=1)))
(potential((tk(P114)>=1) & (tk(P6)>=1)))
(potential((tk(P115)>=1) & (tk(P1)>=1)))
(potential((tk(P115)>=1) & (tk(P2)>=1)))
(potential((tk(P115)>=1) & (tk(P3)>=1)))
(potential((tk(P115)>=1) & (tk(P4)>=1)))
(potential((tk(P115)>=1) & (tk(P5)>=1)))
(potential((tk(P115)>=1) & (tk(P6)>=1)))
(potential((tk(P116)>=1) & (tk(P1)>=1)))
(potential((tk(P116)>=1) & (tk(P2)>=1)))
(potential((tk(P116)>=1) & (tk(P3)>=1)))
(potential((tk(P116)>=1) & (tk(P4)>=1)))
(potential((tk(P116)>=1) & (tk(P5)>=1)))
(potential((tk(P116)>=1) & (tk(P6)>=1)))
(potential((tk(P117)>=1) & (tk(P1)>=1)))
(potential((tk(P117)>=1) & (tk(P2)>=1)))
(potential((tk(P117)>=1) & (tk(P3)>=1)))
(potential((tk(P117)>=1) & (tk(P4)>=1)))
(potential((tk(P117)>=1) & (tk(P5)>=1)))
(potential((tk(P117)>=1) & (tk(P6)>=1)))
(potential((tk(P118)>=1) & (tk(P1)>=1)))
(potential((tk(P118)>=1) & (tk(P2)>=1)))
(potential((tk(P118)>=1) & (tk(P3)>=1)))
(potential((tk(P118)>=1) & (tk(P4)>=1)))
(potential((tk(P118)>=1) & (tk(P5)>=1)))
(potential((tk(P118)>=1) & (tk(P6)>=1)))
(potential((tk(P119)>=1) & (tk(P1)>=1)))
(potential((tk(P119)>=1) & (tk(P2)>=1)))
(potential((tk(P119)>=1) & (tk(P3)>=1)))
(potential((tk(P119)>=1) & (tk(P4)>=1)))
(potential((tk(P119)>=1) & (tk(P5)>=1)))
(potential((tk(P119)>=1) & (tk(P6)>=1)))
(potential((tk(P120)>=1) & (tk(P1)>=1)))
(potential((tk(P120)>=1) & (tk(P2)>=1)))
(potential((tk(P120)>=1) & (tk(P3)>=1)))
(potential((tk(P120)>=1) & (tk(P4)>=1)))
(potential((tk(P120)>=1) & (tk(P5)>=1)))
(potential((tk(P120)>=1) & (tk(P6)>=1)))
(potential((tk(P121)>=1) & (tk(P1)>=1)))
(potential((tk(P121)>=1) & (tk(P2)>=1)))
(potential((tk(P121)>=1) & (tk(P3)>=1)))
(potential((tk(P121)>=1) & (tk(P4)>=1)))
(potential((tk(P121)>=1) & (tk(P5)>=1)))
(potential((tk(P121)>=1) & (tk(P6)>=1)))
(potential((tk(P122)>=1) & (tk(P1)>=1)))
(potential((tk(P122)>=1) & (tk(P2)>=1)))
(potential((tk(P122)>=1) & (tk(P3)>=1)))
(potential((tk(P122)>=1) & (tk(P4)>=1)))
(potential((tk(P122)>=1) & (tk(P5)>=1)))
(potential((tk(P122)>=1) & (tk(P6)>=1)))
(potential((tk(P123)>=1) & (tk(P1)>=1)))
(potential((tk(P123)>=1) & (tk(P2)>=1)))
(potential((tk(P123)>=1) & (tk(P3)>=1)))
(potential((tk(P123)>=1) & (tk(P4)>=1)))
(potential((tk(P123)>=1) & (tk(P5)>=1)))
(potential((tk(P123)>=1) & (tk(P6)>=1)))
(potential((tk(P124)>=1) & (tk(P1)>=1)))
(potential((tk(P124)>=1) & (tk(P2)>=1)))
(potential((tk(P124)>=1) & (tk(P3)>=1)))
(potential((tk(P124)>=1) & (tk(P4)>=1)))
(potential((tk(P124)>=1) & (tk(P5)>=1)))
(potential((tk(P124)>=1) & (tk(P6)>=1)))
(potential((tk(P125)>=1) & (tk(P1)>=1)))
(potential((tk(P125)>=1) & (tk(P2)>=1)))
(potential((tk(P125)>=1) & (tk(P3)>=1)))
(potential((tk(P125)>=1) & (tk(P4)>=1)))
(potential((tk(P125)>=1) & (tk(P5)>=1)))
(potential((tk(P125)>=1) & (tk(P6)>=1)))
(potential((tk(P126)>=1) & (tk(P1)>=1)))
(potential((tk(P126)>=1) & (tk(P2)>=1)))
(potential((tk(P126)>=1) & (tk(P3)>=1)))
(potential((tk(P126)>=1) & (tk(P4)>=1)))
(potential((tk(P126)>=1) & (tk(P5)>=1)))
(potential((tk(P126)>=1) & (tk(P6)>=1)))
(potential((tk(P127)>=1) & (tk(P1)>=1)))
(potential((tk(P127)>=1) & (tk(P2)>=1)))
(potential((tk(P127)>=1) & (tk(P3)>=1)))
(potential((tk(P127)>=1) & (tk(P4)>=1)))
(potential((tk(P127)>=1) & (tk(P5)>=1)))
(potential((tk(P127)>=1) & (tk(P6)>=1)))
(potential((tk(P128)>=1) & (tk(P1)>=1)))
(potential((tk(P128)>=1) & (tk(P2)>=1)))
(potential((tk(P128)>=1) & (tk(P3)>=1)))
(potential((tk(P128)>=1) & (tk(P4)>=1)))
(potential((tk(P128)>=1) & (tk(P5)>=1)))
(potential((tk(P128)>=1) & (tk(P6)>=1)))
(potential((tk(P129)>=1) & (tk(P1)>=1)))
(potential((tk(P129)>=1) & (tk(P2)>=1)))
(potential((tk(P129)>=1) & (tk(P3)>=1)))
(potential((tk(P129)>=1) & (tk(P4)>=1)))
(potential((tk(P129)>=1) & (tk(P5)>=1)))
(potential((tk(P129)>=1) & (tk(P6)>=1)))
(potential((tk(P130)>=1) & (tk(P1)>=1)))
(potential((tk(P130)>=1) & (tk(P2)>=1)))
(potential((tk(P130)>=1) & (tk(P3)>=1)))
(potential((tk(P130)>=1) & (tk(P4)>=1)))
(potential((tk(P130)>=1) & (tk(P5)>=1)))
(potential((tk(P130)>=1) & (tk(P6)>=1)))
(potential((tk(P131)>=1) & (tk(P1)>=1)))
(potential((tk(P131)>=1) & (tk(P2)>=1)))
(potential((tk(P131)>=1) & (tk(P3)>=1)))
(potential((tk(P131)>=1) & (tk(P4)>=1)))
(potential((tk(P131)>=1) & (tk(P5)>=1)))
(potential((tk(P131)>=1) & (tk(P6)>=1)))
(potential((tk(P132)>=1) & (tk(P1)>=1)))
(potential((tk(P132)>=1) & (tk(P2)>=1)))
(potential((tk(P132)>=1) & (tk(P3)>=1)))
(potential((tk(P132)>=1) & (tk(P4)>=1)))
(potential((tk(P132)>=1) & (tk(P5)>=1)))
(potential((tk(P132)>=1) & (tk(P6)>=1)))
(potential((tk(P133)>=1)))
(potential((tk(P134)>=1)))
(potential((tk(P135)>=1)))
(potential((tk(P136)>=1)))
(potential((tk(P137)>=1)))
(potential((tk(P138)>=1)))
(potential((tk(P139)>=1)))
(potential((tk(P140)>=1)))
(potential((tk(P141)>=1)))
(potential((tk(P142)>=1)))
(potential((tk(P143)>=1)))
(potential((tk(P144)>=1)))
(potential((tk(P145)>=1)))
(potential((tk(P146)>=1)))
(potential((tk(P147)>=1)))
(potential((tk(P148)>=1)))
(potential((tk(P149)>=1)))
(potential((tk(P150)>=1)))
(potential((tk(P151)>=1)))
(potential((tk(P152)>=1)))
(potential((tk(P153)>=1)))
(potential((tk(P154)>=1)))
(potential((tk(P155)>=1)))
(potential((tk(P156)>=1)))
(potential((tk(P157)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P159)>=1)))
(potential((tk(P160)>=1)))
(potential((tk(P161)>=1)))
(potential((tk(P162)>=1)))
(potential((tk(P193)>=1) & (tk(P8)>=1)))
(potential((tk(P194)>=1) & (tk(P11)>=1)))
(potential((tk(P195)>=1) & (tk(P14)>=1)))
(potential((tk(P196)>=1) & (tk(P17)>=1)))
(potential((tk(P197)>=1) & (tk(P20)>=1)))
(potential((tk(P198)>=1) & (tk(P23)>=1)))
(potential((tk(P199)>=1)))
(potential((tk(P200)>=1)))
(potential((tk(P201)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P203)>=1)))
(potential((tk(P204)>=1)))
(potential((tk(P205)>=1) & (tk(P9)>=1)))
(potential((tk(P206)>=1) & (tk(P10)>=1)))
(potential((tk(P206)>=1) & (tk(P11)>=1)))
(potential((tk(P207)>=1) & (tk(P13)>=1)))
(potential((tk(P207)>=1) & (tk(P14)>=1)))
(potential((tk(P208)>=1) & (tk(P16)>=1)))
(potential((tk(P208)>=1) & (tk(P17)>=1)))
(potential((tk(P209)>=1) & (tk(P19)>=1)))
(potential((tk(P209)>=1) & (tk(P20)>=1)))
(potential((tk(P210)>=1) & (tk(P22)>=1)))
(potential((tk(P210)>=1) & (tk(P23)>=1)))
(potential((tk(P212)>=1) & (tk(P7)>=1)))
(potential((tk(P212)>=1) & (tk(P8)>=1)))
(potential((tk(P213)>=1) & (tk(P12)>=1)))
(potential((tk(P214)>=1) & (tk(P13)>=1)))
(potential((tk(P214)>=1) & (tk(P14)>=1)))
(potential((tk(P215)>=1) & (tk(P16)>=1)))
(potential((tk(P215)>=1) & (tk(P17)>=1)))
(potential((tk(P216)>=1) & (tk(P19)>=1)))
(potential((tk(P216)>=1) & (tk(P20)>=1)))
(potential((tk(P217)>=1) & (tk(P22)>=1)))
(potential((tk(P217)>=1) & (tk(P23)>=1)))
(potential((tk(P219)>=1) & (tk(P7)>=1)))
(potential((tk(P219)>=1) & (tk(P8)>=1)))
(potential((tk(P220)>=1) & (tk(P10)>=1)))
(potential((tk(P220)>=1) & (tk(P11)>=1)))
(potential((tk(P221)>=1) & (tk(P15)>=1)))
(potential((tk(P222)>=1) & (tk(P16)>=1)))
(potential((tk(P222)>=1) & (tk(P17)>=1)))
(potential((tk(P223)>=1) & (tk(P19)>=1)))
(potential((tk(P223)>=1) & (tk(P20)>=1)))
(potential((tk(P224)>=1) & (tk(P22)>=1)))
(potential((tk(P224)>=1) & (tk(P23)>=1)))
(potential((tk(P226)>=1) & (tk(P7)>=1)))
(potential((tk(P226)>=1) & (tk(P8)>=1)))
(potential((tk(P227)>=1) & (tk(P10)>=1)))
(potential((tk(P227)>=1) & (tk(P11)>=1)))
(potential((tk(P228)>=1) & (tk(P13)>=1)))
(potential((tk(P228)>=1) & (tk(P14)>=1)))
(potential((tk(P229)>=1) & (tk(P18)>=1)))
(potential((tk(P230)>=1) & (tk(P19)>=1)))
(potential((tk(P230)>=1) & (tk(P20)>=1)))
(potential((tk(P231)>=1) & (tk(P22)>=1)))
(potential((tk(P231)>=1) & (tk(P23)>=1)))
(potential((tk(P233)>=1) & (tk(P7)>=1)))
(potential((tk(P233)>=1) & (tk(P8)>=1)))
(potential((tk(P234)>=1) & (tk(P10)>=1)))
(potential((tk(P234)>=1) & (tk(P11)>=1)))
(potential((tk(P235)>=1) & (tk(P13)>=1)))
(potential((tk(P235)>=1) & (tk(P14)>=1)))
(potential((tk(P236)>=1) & (tk(P16)>=1)))
(potential((tk(P236)>=1) & (tk(P17)>=1)))
(potential((tk(P237)>=1) & (tk(P21)>=1)))
(potential((tk(P238)>=1) & (tk(P22)>=1)))
(potential((tk(P238)>=1) & (tk(P23)>=1)))
(potential((tk(P240)>=1) & (tk(P7)>=1)))
(potential((tk(P240)>=1) & (tk(P8)>=1)))
(potential((tk(P241)>=1) & (tk(P10)>=1)))
(potential((tk(P241)>=1) & (tk(P11)>=1)))
(potential((tk(P242)>=1) & (tk(P13)>=1)))
(potential((tk(P242)>=1) & (tk(P14)>=1)))
(potential((tk(P243)>=1) & (tk(P16)>=1)))
(potential((tk(P243)>=1) & (tk(P17)>=1)))
(potential((tk(P244)>=1) & (tk(P19)>=1)))
(potential((tk(P244)>=1) & (tk(P20)>=1)))
(potential((tk(P245)>=1) & (tk(P24)>=1)))
(potential((tk(P211)>=1)))
(potential((tk(P218)>=1)))
(potential((tk(P225)>=1)))
(potential((tk(P232)>=1)))
(potential((tk(P239)>=1)))
(potential((tk(P246)>=1)))
(potential((tk(P206)>=1) & (tk(P12)>=1)))
(potential((tk(P207)>=1) & (tk(P15)>=1)))
(potential((tk(P208)>=1) & (tk(P18)>=1)))
(potential((tk(P209)>=1) & (tk(P21)>=1)))
(potential((tk(P210)>=1) & (tk(P24)>=1)))
(potential((tk(P212)>=1) & (tk(P9)>=1)))
(potential((tk(P214)>=1) & (tk(P15)>=1)))
(potential((tk(P215)>=1) & (tk(P18)>=1)))
(potential((tk(P216)>=1) & (tk(P21)>=1)))
(potential((tk(P217)>=1) & (tk(P24)>=1)))
(potential((tk(P219)>=1) & (tk(P9)>=1)))
(potential((tk(P220)>=1) & (tk(P12)>=1)))
(potential((tk(P222)>=1) & (tk(P18)>=1)))
(potential((tk(P223)>=1) & (tk(P21)>=1)))
(potential((tk(P224)>=1) & (tk(P24)>=1)))
(potential((tk(P226)>=1) & (tk(P9)>=1)))
(potential((tk(P227)>=1) & (tk(P12)>=1)))
(potential((tk(P228)>=1) & (tk(P15)>=1)))
(potential((tk(P230)>=1) & (tk(P21)>=1)))
(potential((tk(P231)>=1) & (tk(P24)>=1)))
(potential((tk(P233)>=1) & (tk(P9)>=1)))
(potential((tk(P234)>=1) & (tk(P12)>=1)))
(potential((tk(P235)>=1) & (tk(P15)>=1)))
(potential((tk(P236)>=1) & (tk(P18)>=1)))
(potential((tk(P238)>=1) & (tk(P24)>=1)))
(potential((tk(P240)>=1) & (tk(P9)>=1)))
(potential((tk(P241)>=1) & (tk(P12)>=1)))
(potential((tk(P242)>=1) & (tk(P15)>=1)))
(potential((tk(P243)>=1) & (tk(P18)>=1)))
(potential((tk(P244)>=1) & (tk(P21)>=1)))
(potential((tk(P247)>=1)))
(potential((tk(P248)>=1)))
(potential((tk(P249)>=1)))
(potential((tk(P250)>=1)))
(potential((tk(P251)>=1)))
(potential((tk(P252)>=1)))
(potential((tk(P253)>=1)))
(potential((tk(P254)>=1)))
(potential((tk(P255)>=1)))
(potential((tk(P256)>=1)))
(potential((tk(P257)>=1)))
(potential((tk(P258)>=1)))
(potential((tk(P259)>=1)))
(potential((tk(P260)>=1)))
(potential((tk(P261)>=1)))
(potential((tk(P262)>=1)))
(potential((tk(P263)>=1)))
(potential((tk(P264)>=1)))
(potential((tk(P265)>=1)))
(potential((tk(P266)>=1)))
(potential((tk(P267)>=1)))
(potential((tk(P268)>=1)))
(potential((tk(P269)>=1)))
(potential((tk(P270)>=1)))
(potential((tk(P271)>=1)))
(potential((tk(P272)>=1)))
(potential((tk(P273)>=1)))
(potential((tk(P274)>=1)))
(potential((tk(P275)>=1)))
(potential((tk(P276)>=1)))
(potential((tk(P277)>=1)))
(potential((tk(P278)>=1)))
(potential((tk(P279)>=1)))
(potential((tk(P280)>=1)))
(potential((tk(P281)>=1)))
(potential((tk(P282)>=1)))
(potential((tk(P288)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P288)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P288)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P288)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P288)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P288)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P294)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P294)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P294)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P294)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P294)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P294)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P300)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P300)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P300)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P300)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P300)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P300)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P306)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P306)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P306)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P306)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P306)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P306)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P312)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P312)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P312)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P312)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P312)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P312)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P318)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P318)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P318)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P318)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P318)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P318)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P283)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P283)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P283)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P283)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P283)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P283)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P283)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P283)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P283)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P283)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P283)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P283)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P283)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P283)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P283)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P284)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P284)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P284)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P284)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P284)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P284)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P284)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P284)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P284)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P284)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P284)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P284)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P284)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P284)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P284)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P285)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P285)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P285)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P285)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P285)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P285)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P285)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P285)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P285)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P285)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P285)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P285)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P285)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P285)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P285)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P286)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P286)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P286)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P286)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P286)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P286)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P286)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P286)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P286)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P286)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P286)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P286)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P286)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P286)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P286)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P287)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P287)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P287)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P287)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P287)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P287)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P287)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P287)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P287)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P287)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P287)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P287)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P287)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P287)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P287)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P288)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P288)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P288)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P288)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P288)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P288)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P288)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P288)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P288)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P288)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P289)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P289)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P289)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P289)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P289)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P289)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P289)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P289)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P289)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P289)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P289)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P289)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P289)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P289)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P289)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P290)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P290)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P290)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P290)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P290)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P290)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P290)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P290)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P290)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P290)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P290)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P290)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P290)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P290)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P290)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P291)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P291)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P291)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P291)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P291)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P291)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P291)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P291)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P291)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P291)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P291)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P291)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P291)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P291)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P291)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P292)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P292)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P292)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P292)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P292)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P292)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P292)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P292)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P292)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P292)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P292)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P292)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P292)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P292)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P292)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P293)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P293)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P293)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P293)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P293)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P293)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P293)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P293)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P293)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P293)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P293)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P293)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P293)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P293)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P293)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P294)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P294)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P294)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P294)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P294)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P294)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P294)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P294)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P294)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P294)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P295)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P295)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P295)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P295)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P295)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P295)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P295)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P295)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P295)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P295)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P295)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P295)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P295)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P295)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P295)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P296)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P296)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P296)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P296)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P296)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P296)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P296)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P296)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P296)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P296)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P296)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P296)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P296)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P296)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P296)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P297)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P297)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P297)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P297)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P297)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P297)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P297)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P297)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P297)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P297)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P297)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P297)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P297)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P297)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P297)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P298)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P298)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P298)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P298)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P298)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P298)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P298)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P298)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P298)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P298)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P298)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P298)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P298)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P298)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P298)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P299)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P299)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P299)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P299)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P299)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P299)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P299)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P299)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P299)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P299)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P299)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P299)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P299)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P299)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P299)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P300)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P300)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P300)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P300)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P300)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P300)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P300)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P300)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P300)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P300)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P301)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P301)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P301)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P301)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P301)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P301)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P301)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P301)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P301)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P301)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P301)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P301)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P301)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P301)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P301)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P302)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P302)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P302)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P302)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P302)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P302)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P302)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P302)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P302)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P302)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P302)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P302)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P302)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P302)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P302)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P303)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P303)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P303)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P303)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P303)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P303)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P303)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P303)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P303)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P303)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P303)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P303)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P303)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P303)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P303)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P304)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P304)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P304)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P304)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P304)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P304)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P304)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P304)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P304)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P304)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P304)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P304)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P304)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P304)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P304)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P305)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P305)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P305)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P305)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P305)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P305)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P305)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P305)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P305)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P305)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P305)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P305)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P305)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P305)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P305)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P306)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P306)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P306)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P306)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P306)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P306)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P306)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P306)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P306)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P306)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P307)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P307)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P307)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P307)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P307)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P307)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P307)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P307)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P307)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P307)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P307)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P307)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P307)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P307)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P307)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P308)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P308)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P308)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P308)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P308)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P308)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P308)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P308)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P308)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P308)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P308)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P308)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P308)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P308)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P308)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P309)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P309)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P309)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P309)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P309)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P309)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P309)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P309)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P309)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P309)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P309)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P309)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P309)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P309)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P309)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P310)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P310)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P310)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P310)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P310)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P310)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P310)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P310)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P310)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P310)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P310)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P310)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P310)>=1) & (tk(P6)>=1) & (tk(P22)>=1)))
(potential((tk(P310)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P310)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P311)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P311)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P311)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P311)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P311)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P311)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P311)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P311)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P311)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P311)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P311)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P311)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P311)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P311)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P311)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P312)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P312)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P312)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P312)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P312)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P312)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P312)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P312)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P312)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P312)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P313)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P313)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P313)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P313)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P313)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P313)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P313)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P313)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P313)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P313)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P313)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P313)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P313)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P313)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P313)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P314)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P314)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P314)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P314)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P314)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P314)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P314)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P314)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P314)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P314)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P314)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P314)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P314)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P314)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P314)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P315)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P315)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P315)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P315)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P315)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P315)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P315)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P315)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P315)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P315)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P315)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P315)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P315)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P315)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P315)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P316)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P316)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P316)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P316)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P316)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P316)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P316)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P316)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P316)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P316)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P316)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P316)>=1) & (tk(P5)>=1) & (tk(P19)>=1)))
(potential((tk(P316)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P316)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P316)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P317)>=1) & (tk(P1)>=1) & (tk(P7)>=1)))
(potential((tk(P317)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P317)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P317)>=1) & (tk(P2)>=1) & (tk(P10)>=1)))
(potential((tk(P317)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P317)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P317)>=1) & (tk(P3)>=1) & (tk(P13)>=1)))
(potential((tk(P317)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P317)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P317)>=1) & (tk(P4)>=1) & (tk(P16)>=1)))
(potential((tk(P317)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P317)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P317)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P317)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P317)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P318)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P318)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P318)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P318)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P318)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P318)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P318)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P318)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P318)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P318)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P319)>=1) & (tk(P1)>=1)))
(potential((tk(P319)>=1) & (tk(P2)>=1)))
(potential((tk(P319)>=1) & (tk(P3)>=1)))
(potential((tk(P319)>=1) & (tk(P4)>=1)))
(potential((tk(P319)>=1) & (tk(P5)>=1)))
(potential((tk(P319)>=1) & (tk(P6)>=1)))
(potential((tk(P320)>=1) & (tk(P1)>=1)))
(potential((tk(P320)>=1) & (tk(P2)>=1)))
(potential((tk(P320)>=1) & (tk(P3)>=1)))
(potential((tk(P320)>=1) & (tk(P4)>=1)))
(potential((tk(P320)>=1) & (tk(P5)>=1)))
(potential((tk(P320)>=1) & (tk(P6)>=1)))
(potential((tk(P321)>=1) & (tk(P1)>=1)))
(potential((tk(P321)>=1) & (tk(P2)>=1)))
(potential((tk(P321)>=1) & (tk(P3)>=1)))
(potential((tk(P321)>=1) & (tk(P4)>=1)))
(potential((tk(P321)>=1) & (tk(P5)>=1)))
(potential((tk(P321)>=1) & (tk(P6)>=1)))
(potential((tk(P322)>=1) & (tk(P1)>=1)))
(potential((tk(P322)>=1) & (tk(P2)>=1)))
(potential((tk(P322)>=1) & (tk(P3)>=1)))
(potential((tk(P322)>=1) & (tk(P4)>=1)))
(potential((tk(P322)>=1) & (tk(P5)>=1)))
(potential((tk(P322)>=1) & (tk(P6)>=1)))
(potential((tk(P323)>=1) & (tk(P1)>=1)))
(potential((tk(P323)>=1) & (tk(P2)>=1)))
(potential((tk(P323)>=1) & (tk(P3)>=1)))
(potential((tk(P323)>=1) & (tk(P4)>=1)))
(potential((tk(P323)>=1) & (tk(P5)>=1)))
(potential((tk(P323)>=1) & (tk(P6)>=1)))
(potential((tk(P324)>=1) & (tk(P1)>=1)))
(potential((tk(P324)>=1) & (tk(P2)>=1)))
(potential((tk(P324)>=1) & (tk(P3)>=1)))
(potential((tk(P324)>=1) & (tk(P4)>=1)))
(potential((tk(P324)>=1) & (tk(P5)>=1)))
(potential((tk(P324)>=1) & (tk(P6)>=1)))
(potential((tk(P409)>=1)))
(potential((tk(P410)>=1)))
(potential((tk(P411)>=1)))
(potential((tk(P412)>=1)))
(potential((tk(P413)>=1)))
(potential((tk(P414)>=1)))
(potential((tk(P325)>=1) & (tk(P1)>=1)))
(potential((tk(P326)>=1) & (tk(P2)>=1)))
(potential((tk(P327)>=1) & (tk(P3)>=1)))
(potential((tk(P328)>=1) & (tk(P4)>=1)))
(potential((tk(P329)>=1) & (tk(P5)>=1)))
(potential((tk(P330)>=1) & (tk(P6)>=1)))
(potential((tk(P332)>=1) & (tk(P10)>=1)))
(potential((tk(P333)>=1) & (tk(P13)>=1)))
(potential((tk(P334)>=1) & (tk(P16)>=1)))
(potential((tk(P335)>=1) & (tk(P19)>=1)))
(potential((tk(P336)>=1) & (tk(P22)>=1)))
(potential((tk(P337)>=1) & (tk(P7)>=1)))
(potential((tk(P339)>=1) & (tk(P13)>=1)))
(potential((tk(P340)>=1) & (tk(P16)>=1)))
(potential((tk(P341)>=1) & (tk(P19)>=1)))
(potential((tk(P342)>=1) & (tk(P22)>=1)))
(potential((tk(P343)>=1) & (tk(P7)>=1)))
(potential((tk(P344)>=1) & (tk(P10)>=1)))
(potential((tk(P346)>=1) & (tk(P16)>=1)))
(potential((tk(P347)>=1) & (tk(P19)>=1)))
(potential((tk(P348)>=1) & (tk(P22)>=1)))
(potential((tk(P349)>=1) & (tk(P7)>=1)))
(potential((tk(P350)>=1) & (tk(P10)>=1)))
(potential((tk(P351)>=1) & (tk(P13)>=1)))
(potential((tk(P353)>=1) & (tk(P19)>=1)))
(potential((tk(P354)>=1) & (tk(P22)>=1)))
(potential((tk(P355)>=1) & (tk(P7)>=1)))
(potential((tk(P356)>=1) & (tk(P10)>=1)))
(potential((tk(P357)>=1) & (tk(P13)>=1)))
(potential((tk(P358)>=1) & (tk(P16)>=1)))
(potential((tk(P360)>=1) & (tk(P22)>=1)))
(potential((tk(P361)>=1) & (tk(P7)>=1)))
(potential((tk(P362)>=1) & (tk(P10)>=1)))
(potential((tk(P363)>=1) & (tk(P13)>=1)))
(potential((tk(P364)>=1) & (tk(P16)>=1)))
(potential((tk(P365)>=1) & (tk(P19)>=1)))
(potential((tk(P331)>=1) & (tk(P9)>=1)))
(potential((tk(P332)>=1) & (tk(P11)>=1)))
(potential((tk(P332)>=1) & (tk(P12)>=1)))
(potential((tk(P333)>=1) & (tk(P14)>=1)))
(potential((tk(P333)>=1) & (tk(P15)>=1)))
(potential((tk(P334)>=1) & (tk(P17)>=1)))
(potential((tk(P334)>=1) & (tk(P18)>=1)))
(potential((tk(P335)>=1) & (tk(P20)>=1)))
(potential((tk(P335)>=1) & (tk(P21)>=1)))
(potential((tk(P336)>=1) & (tk(P23)>=1)))
(potential((tk(P336)>=1) & (tk(P24)>=1)))
(potential((tk(P337)>=1) & (tk(P8)>=1)))
(potential((tk(P337)>=1) & (tk(P9)>=1)))
(potential((tk(P338)>=1) & (tk(P12)>=1)))
(potential((tk(P339)>=1) & (tk(P14)>=1)))
(potential((tk(P339)>=1) & (tk(P15)>=1)))
(potential((tk(P340)>=1) & (tk(P17)>=1)))
(potential((tk(P340)>=1) & (tk(P18)>=1)))
(potential((tk(P341)>=1) & (tk(P20)>=1)))
(potential((tk(P341)>=1) & (tk(P21)>=1)))
(potential((tk(P342)>=1) & (tk(P23)>=1)))
(potential((tk(P342)>=1) & (tk(P24)>=1)))
(potential((tk(P343)>=1) & (tk(P8)>=1)))
(potential((tk(P343)>=1) & (tk(P9)>=1)))
(potential((tk(P344)>=1) & (tk(P11)>=1)))
(potential((tk(P344)>=1) & (tk(P12)>=1)))
(potential((tk(P345)>=1) & (tk(P15)>=1)))
(potential((tk(P346)>=1) & (tk(P17)>=1)))
(potential((tk(P346)>=1) & (tk(P18)>=1)))
(potential((tk(P347)>=1) & (tk(P20)>=1)))
(potential((tk(P347)>=1) & (tk(P21)>=1)))
(potential((tk(P348)>=1) & (tk(P23)>=1)))
(potential((tk(P348)>=1) & (tk(P24)>=1)))
(potential((tk(P349)>=1) & (tk(P8)>=1)))
(potential((tk(P349)>=1) & (tk(P9)>=1)))
(potential((tk(P350)>=1) & (tk(P11)>=1)))
(potential((tk(P350)>=1) & (tk(P12)>=1)))
(potential((tk(P351)>=1) & (tk(P14)>=1)))
(potential((tk(P351)>=1) & (tk(P15)>=1)))
(potential((tk(P352)>=1) & (tk(P18)>=1)))
(potential((tk(P353)>=1) & (tk(P20)>=1)))
(potential((tk(P353)>=1) & (tk(P21)>=1)))
(potential((tk(P354)>=1) & (tk(P23)>=1)))
(potential((tk(P354)>=1) & (tk(P24)>=1)))
(potential((tk(P355)>=1) & (tk(P8)>=1)))
(potential((tk(P355)>=1) & (tk(P9)>=1)))
(potential((tk(P356)>=1) & (tk(P11)>=1)))
(potential((tk(P356)>=1) & (tk(P12)>=1)))
(potential((tk(P357)>=1) & (tk(P14)>=1)))
(potential((tk(P357)>=1) & (tk(P15)>=1)))
(potential((tk(P358)>=1) & (tk(P17)>=1)))
(potential((tk(P358)>=1) & (tk(P18)>=1)))
(potential((tk(P359)>=1) & (tk(P21)>=1)))
(potential((tk(P360)>=1) & (tk(P23)>=1)))
(potential((tk(P360)>=1) & (tk(P24)>=1)))
(potential((tk(P361)>=1) & (tk(P8)>=1)))
(potential((tk(P361)>=1) & (tk(P9)>=1)))
(potential((tk(P362)>=1) & (tk(P11)>=1)))
(potential((tk(P362)>=1) & (tk(P12)>=1)))
(potential((tk(P363)>=1) & (tk(P14)>=1)))
(potential((tk(P363)>=1) & (tk(P15)>=1)))
(potential((tk(P364)>=1) & (tk(P17)>=1)))
(potential((tk(P364)>=1) & (tk(P18)>=1)))
(potential((tk(P365)>=1) & (tk(P20)>=1)))
(potential((tk(P365)>=1) & (tk(P21)>=1)))
(potential((tk(P366)>=1) & (tk(P24)>=1)))
(potential((tk(P163)>=1)))
(potential((tk(P164)>=1)))
(potential((tk(P165)>=1)))
(potential((tk(P166)>=1)))
(potential((tk(P167)>=1)))
(potential((tk(P168)>=1)))
(potential((tk(P169)>=1)))
(potential((tk(P170)>=1)))
(potential((tk(P171)>=1)))
(potential((tk(P172)>=1)))
(potential((tk(P173)>=1)))
(potential((tk(P174)>=1)))
(potential((tk(P175)>=1)))
(potential((tk(P176)>=1)))
(potential((tk(P177)>=1)))
(potential((tk(P178)>=1)))
(potential((tk(P179)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P182)>=1)))
(potential((tk(P183)>=1)))
(potential((tk(P184)>=1)))
(potential((tk(P185)>=1)))
(potential((tk(P186)>=1)))
(potential((tk(P187)>=1)))
(potential((tk(P188)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P190)>=1)))
(potential((tk(P191)>=1)))
(potential((tk(P192)>=1)))
(potential((tk(P367)>=1) & (tk(P1)>=1)))
(potential((tk(P368)>=1) & (tk(P1)>=1)))
(potential((tk(P369)>=1) & (tk(P1)>=1)))
(potential((tk(P370)>=1) & (tk(P1)>=1)))
(potential((tk(P371)>=1) & (tk(P1)>=1)))
(potential((tk(P372)>=1) & (tk(P1)>=1)))
(potential((tk(P373)>=1) & (tk(P2)>=1)))
(potential((tk(P374)>=1) & (tk(P2)>=1)))
(potential((tk(P375)>=1) & (tk(P2)>=1)))
(potential((tk(P376)>=1) & (tk(P2)>=1)))
(potential((tk(P377)>=1) & (tk(P2)>=1)))
(potential((tk(P378)>=1) & (tk(P2)>=1)))
(potential((tk(P379)>=1) & (tk(P3)>=1)))
(potential((tk(P380)>=1) & (tk(P3)>=1)))
(potential((tk(P381)>=1) & (tk(P3)>=1)))
(potential((tk(P382)>=1) & (tk(P3)>=1)))
(potential((tk(P383)>=1) & (tk(P3)>=1)))
(potential((tk(P384)>=1) & (tk(P3)>=1)))
(potential((tk(P385)>=1) & (tk(P4)>=1)))
(potential((tk(P386)>=1) & (tk(P4)>=1)))
(potential((tk(P387)>=1) & (tk(P4)>=1)))
(potential((tk(P388)>=1) & (tk(P4)>=1)))
(potential((tk(P389)>=1) & (tk(P4)>=1)))
(potential((tk(P390)>=1) & (tk(P4)>=1)))
(potential((tk(P391)>=1) & (tk(P5)>=1)))
(potential((tk(P392)>=1) & (tk(P5)>=1)))
(potential((tk(P393)>=1) & (tk(P5)>=1)))
(potential((tk(P394)>=1) & (tk(P5)>=1)))
(potential((tk(P395)>=1) & (tk(P5)>=1)))
(potential((tk(P396)>=1) & (tk(P5)>=1)))
(potential((tk(P397)>=1) & (tk(P6)>=1)))
(potential((tk(P398)>=1) & (tk(P6)>=1)))
(potential((tk(P399)>=1) & (tk(P6)>=1)))
(potential((tk(P400)>=1) & (tk(P6)>=1)))
(potential((tk(P401)>=1) & (tk(P6)>=1)))
(potential((tk(P402)>=1) & (tk(P6)>=1)))
(potential((tk(P403)>=1) & (tk(P9)>=1)))
(potential((tk(P404)>=1) & (tk(P12)>=1)))
(potential((tk(P405)>=1) & (tk(P15)>=1)))
(potential((tk(P406)>=1) & (tk(P18)>=1)))
(potential((tk(P407)>=1) & (tk(P21)>=1)))
(potential((tk(P408)>=1) & (tk(P24)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12981420 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16164280 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is EisenbergMcGuire-PT-06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r537-tall-167987255000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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