About the Execution of Smart+red for JoinFreeModules-PT-2000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1607425.00 | 0.00 | 0.00 | 2002 ? ? 2002 2002 ? 2003 2002 ? ? ? 2002 ? ? ? ? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r235-tall-167856421400221.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 JoinFreeModules-PT-2000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421400221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678641506911
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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 17:18:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 17:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:18:28] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2023-03-12 17:18:28] [INFO ] Transformed 10001 places.
[2023-03-12 17:18:28] [INFO ] Transformed 16001 transitions.
[2023-03-12 17:18:29] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 667 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-12 17:18:29] [INFO ] Computed 2000 place invariants in 120 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=9 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 897 ms. (steps per millisecond=11 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 908 ms. (steps per millisecond=11 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 962 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=11 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 16) seen :4013
[2023-03-12 17:18:43] [INFO ] Invariant cache hit.
[2023-03-12 17:18:45] [INFO ] [Real]Absence check using 2000 positive place invariants in 769 ms returned sat
[2023-03-12 17:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:18:48] [INFO ] [Real]Absence check using state equation in 3214 ms returned unknown
[2023-03-12 17:18:50] [INFO ] [Real]Absence check using 2000 positive place invariants in 744 ms returned sat
[2023-03-12 17:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:18:53] [INFO ] [Real]Absence check using state equation in 3286 ms returned unknown
[2023-03-12 17:18:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 741 ms returned sat
[2023-03-12 17:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:18:58] [INFO ] [Real]Absence check using state equation in 3305 ms returned unknown
[2023-03-12 17:19:00] [INFO ] [Real]Absence check using 2000 positive place invariants in 737 ms returned sat
[2023-03-12 17:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:03] [INFO ] [Real]Absence check using state equation in 3294 ms returned unknown
[2023-03-12 17:19:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 743 ms returned sat
[2023-03-12 17:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:08] [INFO ] [Real]Absence check using state equation in 3317 ms returned unknown
[2023-03-12 17:19:10] [INFO ] [Real]Absence check using 2000 positive place invariants in 732 ms returned sat
[2023-03-12 17:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:13] [INFO ] [Real]Absence check using state equation in 3448 ms returned unknown
[2023-03-12 17:19:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 730 ms returned sat
[2023-03-12 17:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:18] [INFO ] [Real]Absence check using state equation in 3444 ms returned unknown
[2023-03-12 17:19:20] [INFO ] [Real]Absence check using 2000 positive place invariants in 727 ms returned sat
[2023-03-12 17:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:24] [INFO ] [Real]Absence check using state equation in 3326 ms returned unknown
[2023-03-12 17:19:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 720 ms returned sat
[2023-03-12 17:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:29] [INFO ] [Real]Absence check using state equation in 3339 ms returned unknown
[2023-03-12 17:19:30] [INFO ] [Real]Absence check using 2000 positive place invariants in 740 ms returned sat
[2023-03-12 17:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:34] [INFO ] [Real]Absence check using state equation in 3432 ms returned unknown
[2023-03-12 17:19:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 736 ms returned sat
[2023-03-12 17:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:39] [INFO ] [Real]Absence check using state equation in 3431 ms returned unknown
[2023-03-12 17:19:40] [INFO ] [Real]Absence check using 2000 positive place invariants in 760 ms returned sat
[2023-03-12 17:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:44] [INFO ] [Real]Absence check using state equation in 3408 ms returned unknown
[2023-03-12 17:19:45] [INFO ] [Real]Absence check using 2000 positive place invariants in 729 ms returned sat
[2023-03-12 17:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:49] [INFO ] [Real]Absence check using state equation in 3340 ms returned unknown
[2023-03-12 17:19:50] [INFO ] [Real]Absence check using 2000 positive place invariants in 724 ms returned sat
[2023-03-12 17:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:54] [INFO ] [Real]Absence check using state equation in 3348 ms returned unknown
[2023-03-12 17:19:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 716 ms returned sat
[2023-03-12 17:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:19:59] [INFO ] [Real]Absence check using state equation in 3340 ms returned unknown
[2023-03-12 17:20:00] [INFO ] [Real]Absence check using 2000 positive place invariants in 715 ms returned sat
[2023-03-12 17:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:04] [INFO ] [Real]Absence check using state equation in 3450 ms returned unknown
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2, 2, 1, 2, 2, 2000, 1, 2, 1, 1, 1, 2, 2, 1, 2000, 1]
Support contains 16 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 80 are kept as prefixes of interest. Removing 9920 places using SCC suffix rule.23 ms
Discarding 9920 places :
Also discarding 15872 output transitions
Drop transitions removed 15872 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 110 ms. Remains 80 /10000 variables (removed 9920) and now considering 128/16001 (removed 15873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-12 17:20:04] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 17:20:04] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 80/10000 places, 128/16001 transitions.
[2023-03-12 17:20:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000502 steps, including 2 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 16) seen :29266
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 16) seen :4393
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 16) seen :6248
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 16) seen :5465
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 16) seen :4423
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 16) seen :4406
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1153 ms. (steps per millisecond=867 ) properties (out of 16) seen :4341
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 16) seen :6276
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties (out of 16) seen :4383
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 16) seen :5438
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 16) seen :5509
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 16) seen :5458
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 16) seen :4435
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 16) seen :6254
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 16) seen :5480
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 16) seen :4330
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 16) seen :5467
[2023-03-12 17:20:22] [INFO ] Invariant cache hit.
[2023-03-12 17:20:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-12 17:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-12 17:20:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:20:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2023-03-12 17:20:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:20:23] [INFO ] Added : 30 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 40 ms.
[2023-03-12 17:20:23] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 6 ms to minimize.
[2023-03-12 17:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 17:20:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-12 17:20:23] [INFO ] Added : 32 causal constraints over 7 iterations in 148 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 17:20:23] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-12 17:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:23] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 17:20:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:20:24] [INFO ] Added : 31 causal constraints over 7 iterations in 100 ms. Result :sat
Minimization took 85 ms.
[2023-03-12 17:20:24] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-12 17:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:24] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 27 ms returned sat
[2023-03-12 17:20:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-12 17:20:24] [INFO ] Added : 35 causal constraints over 9 iterations in 167 ms. Result :sat
Minimization took 92 ms.
[2023-03-12 17:20:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:24] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-12 17:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:24] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-12 17:20:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 11 ms returned sat
[2023-03-12 17:20:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:20:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-12 17:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-12 17:20:25] [INFO ] Added : 41 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 25 ms.
[2023-03-12 17:20:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:25] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-12 17:20:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:25] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:20:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:20:25] [INFO ] Added : 45 causal constraints over 10 iterations in 136 ms. Result :sat
Minimization took 40 ms.
[2023-03-12 17:20:25] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:25] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-12 17:20:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:25] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-12 17:20:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:20:25] [INFO ] Added : 36 causal constraints over 8 iterations in 119 ms. Result :sat
Minimization took 55 ms.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:26] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:20:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-03-12 17:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-12 17:20:26] [INFO ] Added : 37 causal constraints over 9 iterations in 151 ms. Result :sat
Minimization took 128 ms.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:26] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:20:26] [INFO ] Added : 47 causal constraints over 10 iterations in 184 ms. Result :sat
Minimization took 61 ms.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-12 17:20:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:27] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 13 ms returned sat
[2023-03-12 17:20:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:20:27] [INFO ] Added : 41 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 111 ms.
[2023-03-12 17:20:27] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:27] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:27] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-12 17:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 17:20:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 17:20:27] [INFO ] Added : 46 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 226 ms.
[2023-03-12 17:20:27] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:28] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-12 17:20:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:20:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-12 17:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 17:20:28] [INFO ] Added : 51 causal constraints over 12 iterations in 248 ms. Result :sat
Minimization took 87 ms.
[2023-03-12 17:20:28] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 17:20:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:20:28] [INFO ] Added : 34 causal constraints over 10 iterations in 338 ms. Result :sat
Minimization took 51 ms.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 17:20:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:20:29] [INFO ] Added : 36 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 162 ms.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-12 17:20:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 17:20:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-12 17:20:29] [INFO ] Added : 34 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:20:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:29] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 17:20:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:20:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:20:30] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[1902, 2001, 1924, 1901, 1850, 2000, 2000, 1750, 1582, 1888, 1402, 1961, 2001, 1750, 2000, 1750]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-12 17:20:40] [INFO ] Invariant cache hit.
[2023-03-12 17:20:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 17:20:40] [INFO ] Invariant cache hit.
[2023-03-12 17:20:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:20:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 17:20:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 17:20:41] [INFO ] Invariant cache hit.
[2023-03-12 17:20:41] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 80/80 places, 128/128 transitions.
[2023-03-12 17:20:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000423 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1185 ) properties (out of 16) seen :29385
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties (out of 16) seen :4381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 16) seen :6280
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 16) seen :5439
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties (out of 16) seen :4358
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 16) seen :4396
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 16) seen :4308
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 16) seen :6276
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 16) seen :4409
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 16) seen :5468
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 16) seen :5478
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 16) seen :5471
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 16) seen :4381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 16) seen :6252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 16) seen :5474
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 16) seen :4329
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 16) seen :5464
[2023-03-12 17:20:59] [INFO ] Invariant cache hit.
[2023-03-12 17:20:59] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:59] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-12 17:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:59] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 17:20:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 17:20:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-12 17:20:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-12 17:20:59] [INFO ] Added : 48 causal constraints over 10 iterations in 132 ms. Result :sat
Minimization took 29 ms.
[2023-03-12 17:20:59] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:20:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-12 17:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:20:59] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-12 17:20:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:20:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-12 17:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-12 17:20:59] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 17:21:00] [INFO ] Added : 32 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:00] [INFO ] Added : 37 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 65 ms.
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-12 17:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 17:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:00] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 17:21:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-12 17:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 17:21:01] [INFO ] Added : 54 causal constraints over 11 iterations in 176 ms. Result :sat
Minimization took 30 ms.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:01] [INFO ] Added : 45 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 29 ms.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:01] [INFO ] Added : 36 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-12 17:21:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-12 17:21:02] [INFO ] Added : 54 causal constraints over 11 iterations in 144 ms. Result :sat
Minimization took 39 ms.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:02] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:02] [INFO ] Added : 36 causal constraints over 10 iterations in 101 ms. Result :sat
Minimization took 65 ms.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 17:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:02] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-12 17:21:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-12 17:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-12 17:21:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:02] [INFO ] Added : 38 causal constraints over 9 iterations in 111 ms. Result :sat
Minimization took 83 ms.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:03] [INFO ] Added : 46 causal constraints over 10 iterations in 124 ms. Result :sat
Minimization took 35 ms.
[2023-03-12 17:21:03] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:03] [INFO ] Added : 50 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 29 ms.
[2023-03-12 17:21:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:03] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 17:21:03] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:04] [INFO ] Added : 34 causal constraints over 10 iterations in 322 ms. Result :sat
Minimization took 44 ms.
[2023-03-12 17:21:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 17:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:04] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-12 17:21:04] [INFO ] Added : 44 causal constraints over 9 iterations in 253 ms. Result :sat
Minimization took 37 ms.
[2023-03-12 17:21:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:04] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 17:21:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-12 17:21:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:21:04] [INFO ] Added : 34 causal constraints over 9 iterations in 121 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 17:21:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:21:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:05] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 17:21:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-12 17:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-12 17:21:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:05] [INFO ] Added : 37 causal constraints over 8 iterations in 99 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2002, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 1999, 2002, 2002, 2000, 2000, 2002, 1999, 1999, 2002, 2002, 2001, 2001, 2000, 2001]
FORMULA JoinFreeModules-PT-2000-UpperBounds-03 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 6 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:16] [INFO ] Computed 15 place invariants in 3 ms
Incomplete random walk after 1000142 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 15) seen :27620
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 15) seen :4394
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 15) seen :6241
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties (out of 15) seen :5447
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 15) seen :4412
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 15) seen :4298
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 15) seen :6301
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 15) seen :4396
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 15) seen :5468
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 15) seen :5500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 15) seen :5457
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 15) seen :4410
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 15) seen :6260
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 15) seen :5493
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 15) seen :4329
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1029 ms. (steps per millisecond=971 ) properties (out of 15) seen :5447
[2023-03-12 17:21:32] [INFO ] Invariant cache hit.
[2023-03-12 17:21:32] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 17:21:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-12 17:21:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:33] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:33] [INFO ] Added : 31 causal constraints over 7 iterations in 78 ms. Result :sat
Minimization took 18 ms.
[2023-03-12 17:21:33] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:33] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-12 17:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-12 17:21:33] [INFO ] Added : 38 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 17:21:33] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:21:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:33] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 17:21:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2023-03-12 17:21:33] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-12 17:21:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-12 17:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-12 17:21:34] [INFO ] Added : 43 causal constraints over 9 iterations in 194 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-12 17:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 17:21:34] [INFO ] Added : 29 causal constraints over 7 iterations in 144 ms. Result :sat
Minimization took 22 ms.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-12 17:21:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 17:21:34] [INFO ] Added : 42 causal constraints over 11 iterations in 168 ms. Result :sat
Minimization took 36 ms.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:34] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-12 17:21:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-12 17:21:35] [INFO ] Added : 44 causal constraints over 10 iterations in 90 ms. Result :sat
Minimization took 41 ms.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 17:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:35] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:21:35] [INFO ] Added : 27 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 17 ms.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:35] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:35] [INFO ] Added : 45 causal constraints over 10 iterations in 113 ms. Result :sat
Minimization took 39 ms.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 17:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:36] [INFO ] Added : 38 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 64 ms.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:36] [INFO ] Added : 43 causal constraints over 10 iterations in 109 ms. Result :sat
Minimization took 29 ms.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 22 ms returned sat
[2023-03-12 17:21:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:36] [INFO ] Added : 40 causal constraints over 10 iterations in 131 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2023-03-12 17:21:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-12 17:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-12 17:21:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-12 17:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 17:21:37] [INFO ] Added : 34 causal constraints over 8 iterations in 137 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 17:21:37] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:37] [INFO ] Added : 23 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 36 ms.
[2023-03-12 17:21:37] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:37] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 17:21:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2023-03-12 17:21:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 17:21:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-12 17:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 17:21:37] [INFO ] Added : 43 causal constraints over 10 iterations in 147 ms. Result :sat
Minimization took 39 ms.
[2023-03-12 17:21:38] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:38] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:38] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 17:21:38] [INFO ] [Nat]Added 15 Read/Feed constraints in 21 ms returned sat
[2023-03-12 17:21:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-12 17:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-12 17:21:38] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-12 17:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-12 17:21:38] [INFO ] Added : 35 causal constraints over 9 iterations in 148 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 1999, 2002, 2000, 2000, 2002, 1999, 2000, 2002, 2002, 2001, 2001, 2000, 2001]
Support contains 15 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 75/75 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-12 17:21:46] [INFO ] Invariant cache hit.
[2023-03-12 17:21:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 17:21:46] [INFO ] Invariant cache hit.
[2023-03-12 17:21:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-12 17:21:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 17:21:46] [INFO ] Invariant cache hit.
[2023-03-12 17:21:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 75/75 places, 120/120 transitions.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-00
[2023-03-12 17:21:46] [INFO ] Invariant cache hit.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :7
[2023-03-12 17:21:46] [INFO ] Invariant cache hit.
[2023-03-12 17:21:46] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:47] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-12 17:21:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:47] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:47] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 17:21:47] [INFO ] Added : 34 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[7]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:21:48] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000180 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10001 ) properties (out of 1) seen :1949
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :2002
[2023-03-12 17:21:48] [INFO ] Invariant cache hit.
[2023-03-12 17:21:48] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2023-03-12 17:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:21:48] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-12 17:21:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 15 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-00 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-00 in 1714 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:48] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11008 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=846 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :106
[2023-03-12 17:21:48] [INFO ] Invariant cache hit.
[2023-03-12 17:21:48] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:48] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 17:21:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:48] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:21:48] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-12 17:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-12 17:21:48] [INFO ] Added : 38 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:21:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000100 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9709 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=4566 ) properties (out of 1) seen :2001
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 17:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:21:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 17:21:49] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-12 17:21:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01 in 1194 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:49] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1376 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :99
[2023-03-12 17:21:49] [INFO ] Invariant cache hit.
[2023-03-12 17:21:49] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-12 17:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:49] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-12 17:21:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:49] [INFO ] [Nat]Added 15 Read/Feed constraints in 20 ms returned sat
[2023-03-12 17:21:49] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:50] [INFO ] Added : 45 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[99]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:21:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000097 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10753 ) properties (out of 1) seen :1937
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :2000
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
[2023-03-12 17:21:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 17:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 17:21:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:21:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-12 17:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-12 17:21:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 17:21:51] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
[2023-03-12 17:21:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
[2023-03-12 17:21:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:51] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-12 17:21:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
[2023-03-12 17:21:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02 in 2021 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:51] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :13
[2023-03-12 17:21:51] [INFO ] Invariant cache hit.
[2023-03-12 17:21:51] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-12 17:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:51] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-12 17:21:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:51] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:51] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:51] [INFO ] Added : 39 causal constraints over 9 iterations in 100 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[13]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=9345 ) properties (out of 1) seen :1991
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :2002
[2023-03-12 17:21:53] [INFO ] Invariant cache hit.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:21:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-12 17:21:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-04 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04 in 1493 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:53] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11010 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2000
[2023-03-12 17:21:53] [INFO ] Invariant cache hit.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 17:21:53] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-12 17:21:53] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:21:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-12 17:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-12 17:21:53] [INFO ] Added : 42 causal constraints over 11 iterations in 169 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:21:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000084 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10310 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2000
[2023-03-12 17:21:53] [INFO ] Invariant cache hit.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:21:53] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 17:21:53] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:21:53] [INFO ] Invariant cache hit.
[2023-03-12 17:21:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-12 17:21:54] [INFO ] Invariant cache hit.
[2023-03-12 17:21:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-12 17:21:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:21:54] [INFO ] Invariant cache hit.
[2023-03-12 17:21:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05 in 863 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:54] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :163
[2023-03-12 17:21:54] [INFO ] Invariant cache hit.
[2023-03-12 17:21:54] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:54] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-12 17:21:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:54] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:54] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:54] [INFO ] Added : 36 causal constraints over 9 iterations in 85 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[163]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:21:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000143 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=10205 ) properties (out of 1) seen :2003
FORMULA JoinFreeModules-PT-2000-UpperBounds-06 2003 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06 in 1438 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:55] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
[2023-03-12 17:21:55] [INFO ] Invariant cache hit.
[2023-03-12 17:21:55] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:21:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-12 17:21:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:55] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:21:55] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 17:21:55] [INFO ] Added : 45 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[4]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:21:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:21:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:21:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000246 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10640 ) properties (out of 1) seen :1995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :2002
[2023-03-12 17:21:56] [INFO ] Invariant cache hit.
[2023-03-12 17:21:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:21:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:21:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:21:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:21:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-12 17:21:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-07 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07 in 1502 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:21:56] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 10544 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=878 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :99
[2023-03-12 17:21:57] [INFO ] Invariant cache hit.
[2023-03-12 17:21:57] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 17:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:21:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:21:57] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-12 17:21:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:21:57] [INFO ] [Nat]Added 15 Read/Feed constraints in 21 ms returned sat
[2023-03-12 17:21:57] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:21:57] [INFO ] Added : 45 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[99]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:04] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:22:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10309 ) properties (out of 1) seen :1997
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7246 ) properties (out of 1) seen :2000
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 17:22:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:22:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2023-03-12 17:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-12 17:22:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:04] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-12 17:22:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08 in 7832 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:04] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11679 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1167 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :99
[2023-03-12 17:22:04] [INFO ] Invariant cache hit.
[2023-03-12 17:22:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 17:22:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:05] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-12 17:22:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:05] [INFO ] [Nat]Added 15 Read/Feed constraints in 20 ms returned sat
[2023-03-12 17:22:05] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:22:05] [INFO ] Added : 40 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[99]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:22:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10752 ) properties (out of 1) seen :1982
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :2000
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
[2023-03-12 17:22:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 17:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:22:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:13] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
[2023-03-12 17:22:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
[2023-03-12 17:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:13] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-12 17:22:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
[2023-03-12 17:22:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000089 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10310 ) properties (out of 1) seen :1982
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :1999
[2023-03-12 17:22:13] [INFO ] Invariant cache hit.
[2023-03-12 17:22:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 17:22:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 17:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:22:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-12 17:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-12 17:22:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:13] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:14] [INFO ] Invariant cache hit.
[2023-03-12 17:22:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 17:22:14] [INFO ] Invariant cache hit.
[2023-03-12 17:22:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-12 17:22:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:14] [INFO ] Invariant cache hit.
[2023-03-12 17:22:14] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09 in 9392 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:14] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11344 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1031 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :99
[2023-03-12 17:22:14] [INFO ] Invariant cache hit.
[2023-03-12 17:22:14] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:14] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:22:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:14] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-12 17:22:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:14] [INFO ] [Nat]Added 15 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:22:14] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 17:22:14] [INFO ] Added : 44 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1000]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 17:22:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000160 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10310 ) properties (out of 1) seen :1978
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :1999
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
[2023-03-12 17:22:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 17:22:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:22:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 17:22:15] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1999]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
[2023-03-12 17:22:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
[2023-03-12 17:22:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-12 17:22:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
[2023-03-12 17:22:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000053 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10526 ) properties (out of 1) seen :1985
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :2000
[2023-03-12 17:22:15] [INFO ] Invariant cache hit.
[2023-03-12 17:22:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 17:22:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 17:22:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:22:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2023-03-12 17:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-12 17:22:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:16] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:16] [INFO ] Invariant cache hit.
[2023-03-12 17:22:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 17:22:16] [INFO ] Invariant cache hit.
[2023-03-12 17:22:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:16] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-12 17:22:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:16] [INFO ] Invariant cache hit.
[2023-03-12 17:22:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10 in 2214 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:16] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 10210 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :10
[2023-03-12 17:22:16] [INFO ] Invariant cache hit.
[2023-03-12 17:22:16] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:22:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:16] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 17:22:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:16] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:22:16] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:22:16] [INFO ] Added : 37 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[10]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:22:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10638 ) properties (out of 1) seen :1983
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :2002
[2023-03-12 17:22:17] [INFO ] Invariant cache hit.
[2023-03-12 17:22:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 17:22:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:22:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-12 17:22:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-11 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11 in 1485 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:17] [INFO ] Computed 15 place invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :106
[2023-03-12 17:22:17] [INFO ] Invariant cache hit.
[2023-03-12 17:22:17] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 17:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:18] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 17:22:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:18] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2023-03-12 17:22:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-12 17:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-12 17:22:18] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:22:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 4 ms to minimize.
[2023-03-12 17:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-12 17:22:18] [INFO ] Added : 34 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:22:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000541 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10758 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6097 ) properties (out of 1) seen :2001
[2023-03-12 17:22:18] [INFO ] Invariant cache hit.
[2023-03-12 17:22:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 17:22:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:18] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:22:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:18] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:19] [INFO ] Invariant cache hit.
[2023-03-12 17:22:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 17:22:19] [INFO ] Invariant cache hit.
[2023-03-12 17:22:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-12 17:22:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:19] [INFO ] Invariant cache hit.
[2023-03-12 17:22:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12 in 1261 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:19] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 11008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1223 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :99
[2023-03-12 17:22:19] [INFO ] Invariant cache hit.
[2023-03-12 17:22:19] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 17:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 17:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:19] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-12 17:22:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:19] [INFO ] [Nat]Added 15 Read/Feed constraints in 21 ms returned sat
[2023-03-12 17:22:19] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-12 17:22:19] [INFO ] Added : 43 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[99]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:22:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
Incomplete random walk after 1000158 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10418 ) properties (out of 1) seen :1939
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :2000
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
[2023-03-12 17:22:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:22:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:20] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
[2023-03-12 17:22:20] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
[2023-03-12 17:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-12 17:22:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
[2023-03-12 17:22:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 17:22:20] [INFO ] Invariant cache hit.
Incomplete random walk after 1000295 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10641 ) properties (out of 1) seen :1994
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :2000
[2023-03-12 17:22:21] [INFO ] Invariant cache hit.
[2023-03-12 17:22:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 17:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 17:22:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-12 17:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-12 17:22:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:21] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:21] [INFO ] Invariant cache hit.
[2023-03-12 17:22:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-12 17:22:21] [INFO ] Invariant cache hit.
[2023-03-12 17:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-12 17:22:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:21] [INFO ] Invariant cache hit.
[2023-03-12 17:22:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13 in 2410 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:21] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2000
[2023-03-12 17:22:21] [INFO ] Invariant cache hit.
[2023-03-12 17:22:21] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:21] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 17:22:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:21] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:22:21] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 17:22:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-12 17:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-12 17:22:21] [INFO ] Added : 43 causal constraints over 10 iterations in 131 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:22:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000070 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10639 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :2000
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
[2023-03-12 17:22:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 17:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-12 17:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2023-03-12 17:22:22] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:22] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
[2023-03-12 17:22:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
[2023-03-12 17:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-12 17:22:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
[2023-03-12 17:22:22] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14 in 915 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15
// Phase 1: matrix 120 rows 75 cols
[2023-03-12 17:22:22] [INFO ] Computed 15 place invariants in 0 ms
Incomplete random walk after 11009 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :99
[2023-03-12 17:22:22] [INFO ] Invariant cache hit.
[2023-03-12 17:22:22] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 17:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 17:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:22] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-12 17:22:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:22:22] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-12 17:22:22] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 17:22:22] [INFO ] Added : 40 causal constraints over 11 iterations in 95 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[99]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 5 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /75 variables (removed 70) and now considering 8/120 (removed 112) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 17:22:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 17:22:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 5/75 places, 8/120 transitions.
[2023-03-12 17:22:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000031 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10526 ) properties (out of 1) seen :1981
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :2000
[2023-03-12 17:22:23] [INFO ] Invariant cache hit.
[2023-03-12 17:22:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 17:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 17:22:23] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 17:22:23] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-12 17:22:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000212 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9261 ) properties (out of 1) seen :1960
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :2001
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 17:22:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 17:22:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 17:22:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 17:22:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-12 17:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-12 17:22:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 17:22:24] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:22:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-12 17:22:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 17:22:24] [INFO ] Invariant cache hit.
[2023-03-12 17:22:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15 in 2277 ms.
[2023-03-12 17:22:24] [INFO ] Flatten gal took : 27 ms
[2023-03-12 17:22:24] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 17:22:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 120 transitions and 315 arcs took 1 ms.
Total runtime 236666 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running JoinFreeModules (PT), instance 2000
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 75 places, 120 transitions, 315 arcs.
Final Score: 342.354
Took : 2 seconds
Bounds file is: UpperBounds.xml
BK_STOP 1678643114336
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 1504 Killed ${SMART}/smart ${INPUT_SM}
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="JoinFreeModules-PT-2000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 JoinFreeModules-PT-2000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;