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-167987255000173.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-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 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 3.1M 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 StableMarking

=== Now, execution of the tool begins

BK_START 1680817867612

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:51:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 21:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:51:09] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-04-06 21:51:09] [INFO ] Transformed 1090 places.
[2023-04-06 21:51:09] [INFO ] Transformed 5200 transitions.
[2023-04-06 21:51:09] [INFO ] Found NUPN structural information;
[2023-04-06 21:51:09] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 298 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 1090) seen :679
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 411) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 411) seen :0
Running SMT prover for 411 properties.
[2023-04-06 21:51:10] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-06 21:51:10] [INFO ] Computed 31 invariants in 35 ms
[2023-04-06 21:51:19] [INFO ] After 8701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:411
[2023-04-06 21:51:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-04-06 21:51:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-06 21:51:44] [INFO ] After 11939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :411
[2023-04-06 21:51:44] [INFO ] State equation strengthened by 1246 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:353)
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:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 21:51:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 21:51:44] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:411
Fused 411 Parikh solutions to 138 different solutions.
Parikh walk visited 0 properties in 1576 ms.
Support contains 411 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 5 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 8 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 718 place count 731 transition count 4031
Applied a total of 718 rules in 545 ms. Remains 731 /1090 variables (removed 359) and now considering 4031/5200 (removed 1169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 731/1090 places, 4031/5200 transitions.
Interrupted random walk after 747042 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 354) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 353) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 352) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Running SMT prover for 351 properties.
[2023-04-06 21:52:19] [INFO ] Flow matrix only has 1161 transitions (discarded 2870 similar events)
// Phase 1: matrix 1161 rows 731 cols
[2023-04-06 21:52:19] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:52:24] [INFO ] After 4833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:351
[2023-04-06 21:52:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-04-06 21:52:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 21:52:43] [INFO ] After 11523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :351
[2023-04-06 21:52:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:52:57] [INFO ] After 14371ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :351
[2023-04-06 21:52:57] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 5 ms to minimize.
[2023-04-06 21:52:58] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-04-06 21:52:58] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2023-04-06 21:52:58] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-06 21:52:58] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 1 ms to minimize.
[2023-04-06 21:52:58] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1658 ms
[2023-04-06 21:52:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 21:52:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:52:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 21:53:00] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 21:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-06 21:53:00] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 21:53:01] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:53:01] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:53:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 21:53:02] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:53:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:53:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-04-06 21:53:03] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:53:03] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:53:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-04-06 21:53:03] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:53:04] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:53:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-06 21:53:04] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2023-04-06 21:53:04] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 21:53:05] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2023-04-06 21:53:05] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-04-06 21:53:06] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 0 ms to minimize.
[2023-04-06 21:53:06] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-04-06 21:53:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2023-04-06 21:53:07] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:53:07] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 21:53:08] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:53:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-04-06 21:53:08] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:53:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-06 21:53:09] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-04-06 21:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-04-06 21:53:09] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-04-06 21:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-04-06 21:53:09] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-04-06 21:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-06 21:53:10] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 4 ms to minimize.
[2023-04-06 21:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-04-06 21:53:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-04-06 21:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-04-06 21:53:11] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-04-06 21:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-06 21:53:12] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2023-04-06 21:53:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-06 21:53:13] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2023-04-06 21:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-04-06 21:53:13] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2023-04-06 21:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-06 21:53:14] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2023-04-06 21:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-06 21:53:15] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-04-06 21:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-04-06 21:53:16] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-04-06 21:53:17] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 21:53:17] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-04-06 21:53:18] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:53:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-04-06 21:53:20] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-04-06 21:53:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-06 21:53:21] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:53:21] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:53:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-04-06 21:53:22] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-06 21:53:23] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:53:23] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:53:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-04-06 21:53:24] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:53:24] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-06 21:53:25] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-06 21:53:26] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-06 21:53:26] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 4 ms to minimize.
[2023-04-06 21:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-04-06 21:53:26] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-06 21:53:27] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-06 21:53:27] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-06 21:53:31] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2023-04-06 21:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-06 21:53:31] [INFO ] Deduced a trap composed of 36 places in 300 ms of which 1 ms to minimize.
[2023-04-06 21:53:32] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2023-04-06 21:53:32] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 1 ms to minimize.
[2023-04-06 21:53:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1086 ms
[2023-04-06 21:53:33] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2023-04-06 21:53:33] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2023-04-06 21:53:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2023-04-06 21:53:34] [INFO ] After 51412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :351
Attempting to minimize the solution found.
Minimization took 15675 ms.
[2023-04-06 21:53:50] [INFO ] After 86034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :351
Fused 351 Parikh solutions to 247 different solutions.
Parikh walk visited 0 properties in 17260 ms.
Support contains 351 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 4031/4031 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 680 transition count 3980
Applied a total of 102 rules in 162 ms. Remains 680 /731 variables (removed 51) and now considering 3980/4031 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 680/731 places, 3980/4031 transitions.
Interrupted random walk after 553793 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 349) seen :0
Interrupted probabilistic random walk after 5091548 steps, run timeout after 99001 ms. (steps per millisecond=51 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 66=1, 67=1, 68=1, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 80=1, 81=1, 82=1, 83=1, 84=1, 85=1, 86=1, 87=1, 88=1, 89=1, 92=1, 93=1, 94=1, 95=1, 96=1, 101=1, 102=1, 103=1, 104=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 116=1, 117=1, 118=1, 119=1, 120=1, 121=1, 122=1, 125=1, 126=1, 127=1, 128=1, 129=1, 130=1, 131=1, 133=1, 134=1, 135=1, 136=1, 137=1, 138=1, 139=1, 140=1, 141=1, 142=1, 143=1, 144=1, 145=1, 146=1, 147=1, 148=1, 149=1, 150=1, 152=1, 153=1, 154=1, 155=1, 156=1, 157=1, 158=1, 159=1, 161=1, 162=1, 163=1, 164=1, 165=1, 166=1, 167=1, 168=1, 169=1, 170=1, 171=1, 172=1, 173=1, 174=1, 175=1, 176=1, 177=1, 178=1, 179=1, 180=1, 181=1, 182=1, 183=1, 184=1, 185=1, 186=1, 187=1, 188=1, 189=1, 190=1, 191=1, 192=1, 193=1, 194=1, 195=1, 196=1, 197=1, 198=1, 199=1, 200=1, 201=1, 202=1, 203=1, 204=1, 205=1, 206=1, 207=1, 208=1, 209=1, 210=1, 211=1, 212=1, 213=1, 214=1, 215=1, 216=1, 217=1, 218=1, 219=1, 220=1, 221=1, 222=1, 223=1, 224=1, 225=1, 226=1, 227=1, 228=1, 229=1, 230=1, 231=1, 232=1, 233=1, 234=1, 235=1, 236=1, 237=1, 238=1, 239=1, 240=1, 241=1, 242=1, 243=1, 244=1, 245=1, 246=1, 247=1, 248=1, 249=1, 250=1, 251=1, 252=1, 253=1, 254=1, 255=1, 256=1, 257=1, 258=1, 259=1, 260=1, 261=1, 262=1, 263=1, 264=1, 265=1, 266=1, 269=1, 270=1, 271=1, 272=1, 273=1, 274=1, 275=1, 276=1, 279=1, 280=1, 281=1, 282=1, 283=1, 284=1, 285=1, 289=1, 290=1, 291=1, 292=1, 293=1, 294=1, 299=1, 300=1, 301=1, 302=1, 303=1, 304=1, 309=1, 310=1, 311=1, 312=1, 313=1, 314=1, 315=1, 316=1, 319=1, 320=1, 321=1, 322=1, 323=1, 324=1, 325=1, 326=1, 327=1, 328=1, 329=1, 330=1, 331=1, 332=1, 333=1, 334=1, 335=1, 336=1, 337=1, 338=1, 339=1, 340=1, 341=1, 342=1, 343=1, 344=1, 345=1, 346=1, 347=1, 348=1}
Probabilistic random walk after 5091548 steps, saw 2724985 distinct states, run finished after 99003 ms. (steps per millisecond=51 ) properties seen :316
Running SMT prover for 33 properties.
[2023-04-06 21:56:20] [INFO ] Flow matrix only has 1110 transitions (discarded 2870 similar events)
// Phase 1: matrix 1110 rows 680 cols
[2023-04-06 21:56:20] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:56:21] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-04-06 21:56:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-06 21:56:21] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 21:56:22] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :33
[2023-04-06 21:56:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:56:24] [INFO ] After 1534ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :33
[2023-04-06 21:56:24] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2023-04-06 21:56:24] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 6 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1078 ms
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-04-06 21:56:25] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 721 ms
[2023-04-06 21:56:26] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:56:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-04-06 21:56:27] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 21:56:27] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 21:56:27] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 21:56:27] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-04-06 21:56:28] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-04-06 21:56:28] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:56:29] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:56:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-06 21:56:29] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-04-06 21:56:29] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-04-06 21:56:29] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2023-04-06 21:56:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2023-04-06 21:56:30] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:56:30] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2023-04-06 21:56:30] [INFO ] After 7405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 1408 ms.
[2023-04-06 21:56:31] [INFO ] After 10733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Fused 33 Parikh solutions to 31 different solutions.
Parikh walk visited 0 properties in 905 ms.
Support contains 33 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 3980/3980 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 680 transition count 3890
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 172 ms. Remains 590 /680 variables (removed 90) and now considering 3890/3980 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 590/680 places, 3890/3980 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16681 ms. (steps per millisecond=59 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=462 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=462 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=414 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=420 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=462 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=440 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=473 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=473 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=429 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=446 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=478 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=478 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=434 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=444 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=458 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=438 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=460 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=408 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=476 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=465 ) properties (out of 33) seen :0
Interrupted probabilistic random walk after 4007520 steps, run timeout after 72001 ms. (steps per millisecond=55 ) properties seen :{8=1, 12=1, 13=1, 28=1, 31=1, 32=1}
Probabilistic random walk after 4007520 steps, saw 2195470 distinct states, run finished after 72001 ms. (steps per millisecond=55 ) properties seen :6
Running SMT prover for 27 properties.
[2023-04-06 21:58:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:58:09] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 21:58:09] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-04-06 21:58:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-06 21:58:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:58:10] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-04-06 21:58:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:58:12] [INFO ] After 1129ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 0 ms to minimize.
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:58:12] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1166 ms
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:58:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2023-04-06 21:58:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 21:58:14] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 21:58:14] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:58:14] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-04-06 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-04-06 21:58:15] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-04-06 21:58:15] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-06 21:58:15] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:58:15] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:58:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-04-06 21:58:15] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:58:16] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:58:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-04-06 21:58:16] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:58:16] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-04-06 21:58:16] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2023-04-06 21:58:16] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:58:17] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:58:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 538 ms
[2023-04-06 21:58:17] [INFO ] After 6380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1074 ms.
[2023-04-06 21:58:18] [INFO ] After 8972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 601 ms.
Support contains 27 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 201 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 22357 ms. (steps per millisecond=44 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=374 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=374 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=377 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=377 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 4771074 steps, run timeout after 87001 ms. (steps per millisecond=54 ) properties seen :{4=1, 23=1}
Probabilistic random walk after 4771074 steps, saw 2560775 distinct states, run finished after 87001 ms. (steps per millisecond=54 ) properties seen :2
Running SMT prover for 24 properties.
[2023-04-06 22:00:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:00:15] [INFO ] Invariant cache hit.
[2023-04-06 22:00:15] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:00:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-06 22:00:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:00:17] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:00:17] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:00:18] [INFO ] After 1017ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:00:18] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2023-04-06 22:00:18] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 1 ms to minimize.
[2023-04-06 22:00:18] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 885 ms
[2023-04-06 22:00:19] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2023-04-06 22:00:19] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-06 22:00:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-04-06 22:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 0 ms to minimize.
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:00:20] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2023-04-06 22:00:21] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:00:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 596 ms
[2023-04-06 22:00:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:00:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-04-06 22:00:21] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:00:21] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:00:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-04-06 22:00:21] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2023-04-06 22:00:22] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2023-04-06 22:00:22] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
[2023-04-06 22:00:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-04-06 22:00:22] [INFO ] After 5492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 928 ms.
[2023-04-06 22:00:23] [INFO ] After 7836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 659 ms.
Support contains 24 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23830 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=338 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=338 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=327 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=327 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=337 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=337 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=338 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 4708275 steps, run timeout after 90001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 4708275 steps, saw 2530728 distinct states, run finished after 90002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-06 22:02:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:02:25] [INFO ] Invariant cache hit.
[2023-04-06 22:02:25] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:02:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:02:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:02:27] [INFO ] After 869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:02:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:02:28] [INFO ] After 952ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:02:28] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2023-04-06 22:02:28] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 1 ms to minimize.
[2023-04-06 22:02:28] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 22:02:28] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2023-04-06 22:02:28] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 865 ms
[2023-04-06 22:02:29] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-04-06 22:02:29] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:02:29] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 22:02:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:02:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 22:02:30] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-04-06 22:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-06 22:02:30] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2023-04-06 22:02:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:02:30] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2023-04-06 22:02:30] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2023-04-06 22:02:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 581 ms
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-04-06 22:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:02:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:02:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-04-06 22:02:31] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:02:32] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:02:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-04-06 22:02:32] [INFO ] After 5248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 900 ms.
[2023-04-06 22:02:33] [INFO ] After 7493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 476 ms.
Support contains 24 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:02:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:02:34] [INFO ] Invariant cache hit.
[2023-04-06 22:02:34] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-04-06 22:02:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:02:34] [INFO ] Invariant cache hit.
[2023-04-06 22:02:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:02:37] [INFO ] Implicit Places using invariants and state equation in 3286 ms returned []
Implicit Place search using SMT with State Equation took 3903 ms to find 0 implicit places.
[2023-04-06 22:02:38] [INFO ] Redundant transitions in 248 ms returned []
[2023-04-06 22:02:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:02:38] [INFO ] Invariant cache hit.
[2023-04-06 22:02:39] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5392 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1629 ms. (steps per millisecond=61 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-04-06 22:02:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:02:40] [INFO ] Invariant cache hit.
[2023-04-06 22:02:41] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:02:41] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:02:41] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2023-04-06 22:02:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:02:41] [INFO ] After 199ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :24
[2023-04-06 22:02:43] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-04-06 22:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-04-06 22:02:43] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-04-06 22:02:43] [INFO ] After 2372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:02:43] [INFO ] After 2726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:02:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:02:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:02:44] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:02:44] [INFO ] After 252ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:02:44] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2023-04-06 22:02:44] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-06 22:02:44] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 0 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 0 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1215 ms
[2023-04-06 22:02:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:02:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-04-06 22:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-04-06 22:02:47] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 22:02:47] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-06 22:02:47] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-04-06 22:02:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-04-06 22:02:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:02:48] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:02:48] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:02:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-04-06 22:02:48] [INFO ] After 4562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-04-06 22:02:48] [INFO ] After 5118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18647 ms. (steps per millisecond=53 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=386 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=396 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=386 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=396 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=396 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=390 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=395 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=386 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 3691578 steps, run timeout after 72001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 3691578 steps, saw 2039592 distinct states, run finished after 72001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-06 22:04:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:25] [INFO ] Invariant cache hit.
[2023-04-06 22:04:25] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:04:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:04:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:27] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:04:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:04:28] [INFO ] After 1020ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:04:28] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-04-06 22:04:28] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 0 ms to minimize.
[2023-04-06 22:04:28] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 887 ms
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 589 ms
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:04:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-04-06 22:04:32] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:04:32] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-04-06 22:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-04-06 22:04:32] [INFO ] After 5429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 986 ms.
[2023-04-06 22:04:33] [INFO ] After 7818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 641 ms.
Support contains 24 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:04:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:34] [INFO ] Invariant cache hit.
[2023-04-06 22:04:35] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-04-06 22:04:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:35] [INFO ] Invariant cache hit.
[2023-04-06 22:04:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:04:38] [INFO ] Implicit Places using invariants and state equation in 3629 ms returned []
Implicit Place search using SMT with State Equation took 4186 ms to find 0 implicit places.
[2023-04-06 22:04:39] [INFO ] Redundant transitions in 222 ms returned []
[2023-04-06 22:04:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:39] [INFO ] Invariant cache hit.
[2023-04-06 22:04:40] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5725 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2350 ms. (steps per millisecond=42 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-04-06 22:04:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:42] [INFO ] Invariant cache hit.
[2023-04-06 22:04:42] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:04:42] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:42] [INFO ] After 225ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2023-04-06 22:04:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:04:43] [INFO ] After 187ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :24
[2023-04-06 22:04:44] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2023-04-06 22:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-04-06 22:04:45] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2023-04-06 22:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-04-06 22:04:45] [INFO ] After 2352ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:04:45] [INFO ] After 2679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:04:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:04:45] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:45] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:04:45] [INFO ] After 265ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:04:46] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 0 ms to minimize.
[2023-04-06 22:04:46] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-06 22:04:46] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-04-06 22:04:46] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-04-06 22:04:46] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1170 ms
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 22:04:49] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 22:04:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2023-04-06 22:04:49] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-04-06 22:04:50] [INFO ] After 4741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-04-06 22:04:50] [INFO ] After 5336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 399047 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 399047 steps, saw 262632 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:53] [INFO ] Invariant cache hit.
[2023-04-06 22:04:53] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:04:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:04:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:54] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:04:54] [INFO ] After 90ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:54] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 22:04:54] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 22:04:54] [INFO ] After 609ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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
Interrupted probabilistic random walk after 404382 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404382 steps, saw 266165 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:04:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:57] [INFO ] Invariant cache hit.
[2023-04-06 22:04:57] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:04:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:04:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:04:58] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:04:58] [INFO ] After 91ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:58] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-06 22:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 22:04:58] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 22:04:58] [INFO ] After 610ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:04:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:58] [INFO ] Invariant cache hit.
[2023-04-06 22:04:59] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-04-06 22:04:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:04:59] [INFO ] Invariant cache hit.
[2023-04-06 22:04:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:03] [INFO ] Implicit Places using invariants and state equation in 3802 ms returned []
Implicit Place search using SMT with State Equation took 4376 ms to find 0 implicit places.
[2023-04-06 22:05:03] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:05:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:03] [INFO ] Invariant cache hit.
[2023-04-06 22:05:04] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5817 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 72 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:05:04] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:05:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:05:04] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:05:04] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:04] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:05:04] [INFO ] After 79ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405988 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405988 steps, saw 267206 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:05:07] [INFO ] Computed 31 invariants in 10 ms
[2023-04-06 22:05:07] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:07] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:08] [INFO ] After 107ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:08] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 22:05:08] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 22:05:08] [INFO ] After 645ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 136 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403821 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403821 steps, saw 265800 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:11] [INFO ] Invariant cache hit.
[2023-04-06 22:05:11] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2023-04-06 22:05:11] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:11] [INFO ] After 92ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:12] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 22:05:12] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 22:05:12] [INFO ] After 618ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 137 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:05:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:12] [INFO ] Invariant cache hit.
[2023-04-06 22:05:13] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-04-06 22:05:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:13] [INFO ] Invariant cache hit.
[2023-04-06 22:05:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:16] [INFO ] Implicit Places using invariants and state equation in 3486 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
[2023-04-06 22:05:16] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:05:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:16] [INFO ] Invariant cache hit.
[2023-04-06 22:05:17] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5552 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 36 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:05:17] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:05:17] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:05:18] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:05:18] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:18] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:05:18] [INFO ] After 86ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 402974 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402974 steps, saw 265243 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:05:21] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:05:21] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:21] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:21] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:21] [INFO ] After 100ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:21] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:05:21] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 22:05:21] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 403832 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403832 steps, saw 265809 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:24] [INFO ] Invariant cache hit.
[2023-04-06 22:05:25] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:05:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:25] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:25] [INFO ] After 98ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:25] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 22:05:25] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-06 22:05:25] [INFO ] After 615ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:05:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:25] [INFO ] Invariant cache hit.
[2023-04-06 22:05:26] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-04-06 22:05:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:26] [INFO ] Invariant cache hit.
[2023-04-06 22:05:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:30] [INFO ] Implicit Places using invariants and state equation in 3535 ms returned []
Implicit Place search using SMT with State Equation took 4134 ms to find 0 implicit places.
[2023-04-06 22:05:30] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:05:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:30] [INFO ] Invariant cache hit.
[2023-04-06 22:05:31] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5513 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 29 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:05:31] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:05:31] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:05:31] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:05:31] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:31] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:05:31] [INFO ] After 80ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 402820 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402820 steps, saw 265121 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:05:34] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 22:05:34] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:34] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:34] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:35] [INFO ] After 100ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:35] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 22:05:35] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-06 22:05:35] [INFO ] After 635ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403557 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403557 steps, saw 265611 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:38] [INFO ] Invariant cache hit.
[2023-04-06 22:05:38] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:05:38] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:38] [INFO ] After 112ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:39] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:05:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 22:05:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2023-04-06 22:05:39] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 22:05:39] [INFO ] After 778ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:05:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:39] [INFO ] Invariant cache hit.
[2023-04-06 22:05:40] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-04-06 22:05:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:40] [INFO ] Invariant cache hit.
[2023-04-06 22:05:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:43] [INFO ] Implicit Places using invariants and state equation in 3314 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2023-04-06 22:05:43] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:05:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:43] [INFO ] Invariant cache hit.
[2023-04-06 22:05:44] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5269 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 27 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:05:44] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:05:44] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:05:44] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:05:44] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:44] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:05:44] [INFO ] After 77ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386111 steps, run timeout after 3003 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386111 steps, saw 254951 distinct states, run finished after 3003 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:05:47] [INFO ] Computed 31 invariants in 3 ms
[2023-04-06 22:05:47] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:48] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:48] [INFO ] After 103ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:48] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 22:05:48] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 22:05:48] [INFO ] After 654ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 379258 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379258 steps, saw 250921 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:05:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:51] [INFO ] Invariant cache hit.
[2023-04-06 22:05:51] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:52] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:52] [INFO ] After 117ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:52] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 22:05:52] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:05:52] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 22:05:52] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 797 ms
[2023-04-06 22:05:53] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 22:05:53] [INFO ] After 1349ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 145 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:05:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:53] [INFO ] Invariant cache hit.
[2023-04-06 22:05:54] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-04-06 22:05:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:54] [INFO ] Invariant cache hit.
[2023-04-06 22:05:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:57] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
[2023-04-06 22:05:57] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:05:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:05:57] [INFO ] Invariant cache hit.
[2023-04-06 22:05:58] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5362 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 30 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:05:58] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:05:58] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:05:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:05:58] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:05:58] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:05:58] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:05:58] [INFO ] After 79ms 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 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381293 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381293 steps, saw 252092 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:01] [INFO ] Computed 31 invariants in 8 ms
[2023-04-06 22:06:02] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:06:02] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:02] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:02] [INFO ] After 112ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:02] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:06:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:06:02] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-04-06 22:06:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2023-04-06 22:06:02] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-06 22:06:02] [INFO ] After 924ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 375342 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375342 steps, saw 248715 distinct states, run finished after 3003 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:06] [INFO ] Invariant cache hit.
[2023-04-06 22:06:06] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:06] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:06] [INFO ] After 114ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:06] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 22:06:06] [INFO ] After 571ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:06:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:07] [INFO ] Invariant cache hit.
[2023-04-06 22:06:07] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-04-06 22:06:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:07] [INFO ] Invariant cache hit.
[2023-04-06 22:06:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:11] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 4042 ms to find 0 implicit places.
[2023-04-06 22:06:11] [INFO ] Redundant transitions in 135 ms returned []
[2023-04-06 22:06:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:11] [INFO ] Invariant cache hit.
[2023-04-06 22:06:12] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5467 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 28 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:06:12] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:06:12] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:12] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:06:12] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:12] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:06:12] [INFO ] After 82ms 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 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386111 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386111 steps, saw 254951 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:15] [INFO ] Computed 31 invariants in 8 ms
[2023-04-06 22:06:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:16] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:16] [INFO ] After 106ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 22:06:16] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 22:06:16] [INFO ] After 657ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 140 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 395296 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395296 steps, saw 260497 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:19] [INFO ] Invariant cache hit.
[2023-04-06 22:06:19] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:06:19] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:19] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:20] [INFO ] After 104ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 22:06:20] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 22:06:20] [INFO ] After 651ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 142 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:06:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:20] [INFO ] Invariant cache hit.
[2023-04-06 22:06:21] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-04-06 22:06:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:21] [INFO ] Invariant cache hit.
[2023-04-06 22:06:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:24] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 4021 ms to find 0 implicit places.
[2023-04-06 22:06:24] [INFO ] Redundant transitions in 136 ms returned []
[2023-04-06 22:06:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:24] [INFO ] Invariant cache hit.
[2023-04-06 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5457 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 26 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:06:25] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:06:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:25] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:06:25] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:26] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:06:26] [INFO ] After 90ms 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 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 383075 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 383075 steps, saw 253259 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:29] [INFO ] Computed 31 invariants in 8 ms
[2023-04-06 22:06:29] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:29] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:29] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:29] [INFO ] After 103ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:29] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:06:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 22:06:29] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 22:06:29] [INFO ] After 644ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 376288 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376288 steps, saw 249364 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:32] [INFO ] Invariant cache hit.
[2023-04-06 22:06:33] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:33] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:33] [INFO ] After 104ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:33] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-04-06 22:06:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-04-06 22:06:33] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 22:06:33] [INFO ] After 719ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 143 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:06:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:34] [INFO ] Invariant cache hit.
[2023-04-06 22:06:34] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-04-06 22:06:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:34] [INFO ] Invariant cache hit.
[2023-04-06 22:06:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:38] [INFO ] Implicit Places using invariants and state equation in 3892 ms returned []
Implicit Place search using SMT with State Equation took 4502 ms to find 0 implicit places.
[2023-04-06 22:06:38] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:06:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:38] [INFO ] Invariant cache hit.
[2023-04-06 22:06:39] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5853 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:06:39] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:06:39] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:39] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:06:39] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:39] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:06:39] [INFO ] After 77ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 394702 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394702 steps, saw 260188 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:42] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:06:43] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:43] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:43] [INFO ] After 102ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:43] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 22:06:43] [INFO ] After 543ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 393019 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 393019 steps, saw 259501 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:46] [INFO ] Invariant cache hit.
[2023-04-06 22:06:46] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:06:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:47] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:47] [INFO ] After 125ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:47] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-06 22:06:47] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 22:06:47] [INFO ] After 646ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:06:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:47] [INFO ] Invariant cache hit.
[2023-04-06 22:06:48] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-04-06 22:06:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:48] [INFO ] Invariant cache hit.
[2023-04-06 22:06:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:51] [INFO ] Implicit Places using invariants and state equation in 3609 ms returned []
Implicit Place search using SMT with State Equation took 4191 ms to find 0 implicit places.
[2023-04-06 22:06:52] [INFO ] Redundant transitions in 132 ms returned []
[2023-04-06 22:06:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:52] [INFO ] Invariant cache hit.
[2023-04-06 22:06:53] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5545 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:06:53] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:06:53] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:53] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:06:53] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:53] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:06:53] [INFO ] After 85ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 393624 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393624 steps, saw 259750 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:56] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:06:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:06:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:56] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:56] [INFO ] After 112ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:06:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 22:06:56] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 22:06:57] [INFO ] After 617ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 393899 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393899 steps, saw 259863 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:00] [INFO ] Invariant cache hit.
[2023-04-06 22:07:00] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:07:00] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:07:00] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:00] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:00] [INFO ] After 123ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:00] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-04-06 22:07:00] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:07:01] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 22:07:01] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:07:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 498 ms
[2023-04-06 22:07:01] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 22:07:01] [INFO ] After 1036ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:07:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:01] [INFO ] Invariant cache hit.
[2023-04-06 22:07:02] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-04-06 22:07:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:02] [INFO ] Invariant cache hit.
[2023-04-06 22:07:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:05] [INFO ] Implicit Places using invariants and state equation in 3343 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2023-04-06 22:07:05] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:07:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:05] [INFO ] Invariant cache hit.
[2023-04-06 22:07:06] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5232 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:07:06] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:07:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:07:06] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:07:06] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:06] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-06 22:07:06] [INFO ] After 95ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 393657 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393657 steps, saw 259761 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:07:09] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:07:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:07:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:07:10] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:10] [INFO ] After 98ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 22:07:10] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:07:10] [INFO ] After 603ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 137 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 392656 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392656 steps, saw 259337 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:13] [INFO ] Invariant cache hit.
[2023-04-06 22:07:13] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:07:13] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:07:14] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:14] [INFO ] After 96ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:14] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 22:07:14] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 22:07:14] [INFO ] After 611ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:07:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:14] [INFO ] Invariant cache hit.
[2023-04-06 22:07:15] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-04-06 22:07:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:15] [INFO ] Invariant cache hit.
[2023-04-06 22:07:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:18] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
[2023-04-06 22:07:18] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:07:18] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:18] [INFO ] Invariant cache hit.
[2023-04-06 22:07:19] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5262 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 171 transition count 342
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 162 transition count 342
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 162 transition count 333
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 775 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 866 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 957 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 967 place count 71 transition count 232
Applied a total of 967 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-06 22:07:19] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:07:19] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:07:19] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:07:19] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:19] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:07:19] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 392799 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392799 steps, saw 259399 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:07:23] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:07:23] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:07:23] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:07:23] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:23] [INFO ] After 94ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:23] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:07:23] [INFO ] After 507ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 392799 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392799 steps, saw 259399 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:26] [INFO ] Invariant cache hit.
[2023-04-06 22:07:26] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:07:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-06 22:07:27] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:27] [INFO ] After 92ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:27] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 22:07:27] [INFO ] After 509ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:07:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:27] [INFO ] Invariant cache hit.
[2023-04-06 22:07:28] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-04-06 22:07:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:28] [INFO ] Invariant cache hit.
[2023-04-06 22:07:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:31] [INFO ] Implicit Places using invariants and state equation in 3338 ms returned []
Implicit Place search using SMT with State Equation took 3926 ms to find 0 implicit places.
[2023-04-06 22:07:31] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:07:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:31] [INFO ] Invariant cache hit.
[2023-04-06 22:07:32] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5258 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 26 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:07:32] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:07:32] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:07:32] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:07:32] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:32] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:07:32] [INFO ] After 85ms 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 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 392414 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392414 steps, saw 259206 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:07:35] [INFO ] Computed 31 invariants in 4 ms
[2023-04-06 22:07:36] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:07:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:07:36] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:36] [INFO ] After 107ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 22:07:36] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 22:07:36] [INFO ] After 611ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 393613 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393613 steps, saw 259747 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:39] [INFO ] Invariant cache hit.
[2023-04-06 22:07:39] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:07:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:07:40] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:40] [INFO ] After 91ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 22:07:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 22:07:40] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 22:07:40] [INFO ] After 590ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:07:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:40] [INFO ] Invariant cache hit.
[2023-04-06 22:07:41] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-04-06 22:07:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:41] [INFO ] Invariant cache hit.
[2023-04-06 22:07:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:44] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 4118 ms to find 0 implicit places.
[2023-04-06 22:07:44] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:07:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:44] [INFO ] Invariant cache hit.
[2023-04-06 22:07:46] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5455 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:07:46] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:07:46] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:07:46] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:07:46] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:46] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:07:46] [INFO ] After 79ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 394614 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394614 steps, saw 260156 distinct states, run finished after 3003 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:07:49] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:07:49] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-06 22:07:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-06 22:07:49] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:49] [INFO ] After 86ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:49] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 22:07:49] [INFO ] After 501ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 137 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 393558 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393558 steps, saw 259732 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:07:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:52] [INFO ] Invariant cache hit.
[2023-04-06 22:07:53] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:07:53] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:07:53] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:53] [INFO ] After 86ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:53] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 22:07:53] [INFO ] After 494ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:07:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:53] [INFO ] Invariant cache hit.
[2023-04-06 22:07:54] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-04-06 22:07:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:54] [INFO ] Invariant cache hit.
[2023-04-06 22:07:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:07:57] [INFO ] Implicit Places using invariants and state equation in 3544 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
[2023-04-06 22:07:58] [INFO ] Redundant transitions in 128 ms returned []
[2023-04-06 22:07:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:07:58] [INFO ] Invariant cache hit.
[2023-04-06 22:07:59] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5473 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 26 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:07:59] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:07:59] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:07:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:07:59] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:07:59] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:07:59] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:07:59] [INFO ] After 76ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 400686 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400686 steps, saw 263705 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:08:02] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:08:02] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:02] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:08:02] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:02] [INFO ] After 82ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:02] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:08:02] [INFO ] After 495ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 135 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 399190 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399190 steps, saw 262761 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:06] [INFO ] Invariant cache hit.
[2023-04-06 22:08:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:08:06] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:06] [INFO ] After 75ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:06] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 22:08:06] [INFO ] After 486ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:08:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:06] [INFO ] Invariant cache hit.
[2023-04-06 22:08:07] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-04-06 22:08:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:07] [INFO ] Invariant cache hit.
[2023-04-06 22:08:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:11] [INFO ] Implicit Places using invariants and state equation in 3700 ms returned []
Implicit Place search using SMT with State Equation took 4292 ms to find 0 implicit places.
[2023-04-06 22:08:11] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:08:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:11] [INFO ] Invariant cache hit.
[2023-04-06 22:08:12] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5639 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:08:12] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:08:12] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:08:12] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:08:12] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:12] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:08:12] [INFO ] After 82ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403260 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403260 steps, saw 265434 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:08:15] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 22:08:15] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-06 22:08:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:08:15] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:16] [INFO ] After 84ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:16] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:08:16] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:08:16] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:08:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2023-04-06 22:08:16] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 22:08:16] [INFO ] After 794ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 402083 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 402083 steps, saw 264573 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:19] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:19] [INFO ] Invariant cache hit.
[2023-04-06 22:08:19] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:08:19] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-06 22:08:20] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:20] [INFO ] After 85ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:20] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-06 22:08:20] [INFO ] After 514ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 133 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:08:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:20] [INFO ] Invariant cache hit.
[2023-04-06 22:08:21] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-04-06 22:08:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:21] [INFO ] Invariant cache hit.
[2023-04-06 22:08:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:24] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4093 ms to find 0 implicit places.
[2023-04-06 22:08:24] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:08:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:24] [INFO ] Invariant cache hit.
[2023-04-06 22:08:25] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5435 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:08:25] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:08:25] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:08:25] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:08:25] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:25] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:08:25] [INFO ] After 83ms 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 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401819 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401819 steps, saw 264420 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:08:28] [INFO ] Computed 31 invariants in 3 ms
[2023-04-06 22:08:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:08:29] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:08:29] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:29] [INFO ] After 82ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 22:08:29] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-06 22:08:29] [INFO ] After 579ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 403700 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403700 steps, saw 265721 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:32] [INFO ] Invariant cache hit.
[2023-04-06 22:08:32] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:08:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:08:33] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:33] [INFO ] After 81ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:33] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:08:33] [INFO ] After 508ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:08:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:33] [INFO ] Invariant cache hit.
[2023-04-06 22:08:34] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-04-06 22:08:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:34] [INFO ] Invariant cache hit.
[2023-04-06 22:08:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:37] [INFO ] Implicit Places using invariants and state equation in 3652 ms returned []
Implicit Place search using SMT with State Equation took 4237 ms to find 0 implicit places.
[2023-04-06 22:08:38] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:08:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:38] [INFO ] Invariant cache hit.
[2023-04-06 22:08:39] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5601 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 27 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:08:39] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:08:39] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:08:39] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:08:39] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:39] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:08:39] [INFO ] After 92ms 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 26 ms. (steps per millisecond=384 ) 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 401126 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401126 steps, saw 263933 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:08:42] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:08:42] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:08:42] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:42] [INFO ] After 87ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:42] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:08:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 22:08:42] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 22:08:42] [INFO ] After 588ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 400268 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400268 steps, saw 263470 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:46] [INFO ] Invariant cache hit.
[2023-04-06 22:08:46] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:08:46] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:46] [INFO ] After 87ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:08:46] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:08:46] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:08:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2023-04-06 22:08:46] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 22:08:47] [INFO ] After 782ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 127 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:08:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:47] [INFO ] Invariant cache hit.
[2023-04-06 22:08:47] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-04-06 22:08:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:47] [INFO ] Invariant cache hit.
[2023-04-06 22:08:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:51] [INFO ] Implicit Places using invariants and state equation in 3286 ms returned []
Implicit Place search using SMT with State Equation took 3866 ms to find 0 implicit places.
[2023-04-06 22:08:51] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:08:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:51] [INFO ] Invariant cache hit.
[2023-04-06 22:08:52] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5205 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:08:52] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:08:52] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:08:52] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:08:52] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:52] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:08:52] [INFO ] After 84ms 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 26 ms. (steps per millisecond=384 ) 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 402281 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402281 steps, saw 264726 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:08:55] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:08:55] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:08:55] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:56] [INFO ] After 83ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 22:08:56] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 22:08:56] [INFO ] After 586ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 142 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 399014 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 399014 steps, saw 262618 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:08:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:08:59] [INFO ] Invariant cache hit.
[2023-04-06 22:08:59] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:08:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:08:59] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:08:59] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:08:59] [INFO ] After 89ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:08:59] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:08:59] [INFO ] After 521ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 139 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:09:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:00] [INFO ] Invariant cache hit.
[2023-04-06 22:09:00] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-04-06 22:09:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:00] [INFO ] Invariant cache hit.
[2023-04-06 22:09:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:04] [INFO ] Implicit Places using invariants and state equation in 3600 ms returned []
Implicit Place search using SMT with State Equation took 4180 ms to find 0 implicit places.
[2023-04-06 22:09:04] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:09:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:04] [INFO ] Invariant cache hit.
[2023-04-06 22:09:05] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5520 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:09:05] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:09:05] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:05] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:09:05] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:05] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-06 22:09:05] [INFO ] After 96ms 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 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 395142 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395142 steps, saw 260387 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:09:08] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 22:09:08] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:09:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:09:09] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:09] [INFO ] After 83ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:09] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 22:09:09] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 22:09:09] [INFO ] After 582ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 403469 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403469 steps, saw 265540 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:12] [INFO ] Invariant cache hit.
[2023-04-06 22:09:12] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:09:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:09:13] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:13] [INFO ] After 86ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:13] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 22:09:13] [INFO ] After 511ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:09:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:13] [INFO ] Invariant cache hit.
[2023-04-06 22:09:14] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-04-06 22:09:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:14] [INFO ] Invariant cache hit.
[2023-04-06 22:09:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:17] [INFO ] Implicit Places using invariants and state equation in 3724 ms returned []
Implicit Place search using SMT with State Equation took 4311 ms to find 0 implicit places.
[2023-04-06 22:09:17] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-06 22:09:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:17] [INFO ] Invariant cache hit.
[2023-04-06 22:09:19] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5655 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 22 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:09:19] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:09:19] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:19] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:09:19] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:19] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:09:19] [INFO ] After 79ms 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403535 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403535 steps, saw 265593 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:09:22] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:09:22] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:09:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:09:22] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:22] [INFO ] After 89ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:22] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:09:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 22:09:22] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 22:09:22] [INFO ] After 565ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 405735 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405735 steps, saw 267060 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:26] [INFO ] Invariant cache hit.
[2023-04-06 22:09:26] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:09:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:09:26] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:26] [INFO ] After 78ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:26] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 22:09:26] [INFO ] After 497ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 127 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:09:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:26] [INFO ] Invariant cache hit.
[2023-04-06 22:09:27] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-04-06 22:09:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:27] [INFO ] Invariant cache hit.
[2023-04-06 22:09:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:31] [INFO ] Implicit Places using invariants and state equation in 3865 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
[2023-04-06 22:09:31] [INFO ] Redundant transitions in 136 ms returned []
[2023-04-06 22:09:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:31] [INFO ] Invariant cache hit.
[2023-04-06 22:09:32] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5784 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:09:32] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:09:32] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:32] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:09:32] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:32] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:09:32] [INFO ] After 79ms 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 31 ms. (steps per millisecond=322 ) 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
Interrupted probabilistic random walk after 405691 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405691 steps, saw 267031 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:09:35] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 22:09:35] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:09:35] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:09:36] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:36] [INFO ] After 86ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 22:09:36] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:09:36] [INFO ] After 579ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 402578 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402578 steps, saw 264949 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:39] [INFO ] Invariant cache hit.
[2023-04-06 22:09:39] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:09:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:09:39] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:39] [INFO ] After 81ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:40] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:09:40] [INFO ] After 503ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:09:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:40] [INFO ] Invariant cache hit.
[2023-04-06 22:09:40] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-04-06 22:09:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:40] [INFO ] Invariant cache hit.
[2023-04-06 22:09:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:44] [INFO ] Implicit Places using invariants and state equation in 3579 ms returned []
Implicit Place search using SMT with State Equation took 4166 ms to find 0 implicit places.
[2023-04-06 22:09:44] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 22:09:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:44] [INFO ] Invariant cache hit.
[2023-04-06 22:09:45] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5487 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:09:45] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:09:45] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:45] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:09:45] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:45] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:09:45] [INFO ] After 95ms 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 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 404305 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404305 steps, saw 266117 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:09:48] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 22:09:48] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:09:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:09:49] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:49] [INFO ] After 90ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 22:09:49] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 22:09:49] [INFO ] After 577ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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
Interrupted probabilistic random walk after 404569 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404569 steps, saw 266275 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:09:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:52] [INFO ] Invariant cache hit.
[2023-04-06 22:09:52] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:09:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:09:53] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:53] [INFO ] After 78ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:53] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 22:09:53] [INFO ] After 481ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 140 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:09:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:53] [INFO ] Invariant cache hit.
[2023-04-06 22:09:54] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-04-06 22:09:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:54] [INFO ] Invariant cache hit.
[2023-04-06 22:09:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:09:57] [INFO ] Implicit Places using invariants and state equation in 3099 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
[2023-04-06 22:09:57] [INFO ] Redundant transitions in 129 ms returned []
[2023-04-06 22:09:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:09:57] [INFO ] Invariant cache hit.
[2023-04-06 22:09:58] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4981 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:09:58] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 22:09:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:09:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 22:09:58] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:09:58] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:09:58] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:09:58] [INFO ] After 90ms 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 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 390797 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390797 steps, saw 258105 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:10:01] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:10:01] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:10:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:10:02] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:10:02] [INFO ] After 88ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 22:10:02] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 22:10:02] [INFO ] After 610ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 147 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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
Interrupted probabilistic random walk after 381766 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381766 steps, saw 252425 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:10:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:10:05] [INFO ] Invariant cache hit.
[2023-04-06 22:10:05] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:10:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:10:05] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:05] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:10:06] [INFO ] After 87ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:06] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-06 22:10:06] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 22:10:06] [INFO ] After 617ms 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:10:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:10:06] [INFO ] Invariant cache hit.
[2023-04-06 22:10:07] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-04-06 22:10:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:10:07] [INFO ] Invariant cache hit.
[2023-04-06 22:10:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:10:10] [INFO ] Implicit Places using invariants and state equation in 3408 ms returned []
Implicit Place search using SMT with State Equation took 4002 ms to find 0 implicit places.
[2023-04-06 22:10:10] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 22:10:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:10:10] [INFO ] Invariant cache hit.
[2023-04-06 22:10:11] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5336 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 26 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 22:10:11] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 22:10:11] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:10:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:10:11] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:10:11] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:10:11] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 22:10:11] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 3336 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 500 transition count 642
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 217 place count 392 transition count 642
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 217 place count 392 transition count 621
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 269 place count 361 transition count 621
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 583 place count 204 transition count 464
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 656 place count 204 transition count 391
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 674 place count 195 transition count 391
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 683 place count 195 transition count 382
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 699 place count 195 transition count 366
Free-agglomeration rule applied 101 times.
Iterating global reduction 4 with 101 rules applied. Total rules applied 800 place count 195 transition count 265
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 901 place count 94 transition count 265
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 911 place count 94 transition count 265
Applied a total of 911 rules in 30 ms. Remains 94 /590 variables (removed 496) and now considering 265/3890 (removed 3625) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 265 rows 94 cols
[2023-04-06 22:10:11] [INFO ] Computed 21 invariants in 0 ms
[2023-04-06 22:10:11] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 22:10:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 22:10:12] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-06 22:10:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 22:10:12] [INFO ] After 148ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-06 22:10:12] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-04-06 22:10:12] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Unable to solve all queries for examination StableMarking. Remains :24 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 24 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1143519 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 10
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 1090 places, 5200 transitions, 25400 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14750052 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16118068 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 StableMarking -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-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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