Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716567747004

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:22:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 16:22:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:22:28] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-24 16:22:28] [INFO ] Transformed 4914 places.
[2024-05-24 16:22:28] [INFO ] Transformed 6913 transitions.
[2024-05-24 16:22:28] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 503 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 16:22:28] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-24 16:22:29] [INFO ] Computed 535 invariants in 457 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
RANDOM walk for 10000 steps (191 resets) in 129 ms. (76 steps per ms)
BEST_FIRST walk for 160009 steps (800 resets) in 566 ms. (282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
[2024-05-24 16:22:30] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2024-05-24 16:22:30] [INFO ] Invariant cache hit.
[2024-05-24 16:22:30] [INFO ] [Real]Absence check using 48 positive place invariants in 77 ms returned sat
[2024-05-24 16:22:30] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 169 ms returned unsat
[2024-05-24 16:22:31] [INFO ] [Real]Absence check using 48 positive place invariants in 69 ms returned sat
[2024-05-24 16:22:31] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 51 ms returned unsat
[2024-05-24 16:22:32] [INFO ] [Real]Absence check using 48 positive place invariants in 72 ms returned sat
[2024-05-24 16:22:32] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 167 ms returned unsat
[2024-05-24 16:22:32] [INFO ] [Real]Absence check using 48 positive place invariants in 73 ms returned sat
[2024-05-24 16:22:33] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 175 ms returned sat
[2024-05-24 16:22:36] [INFO ] [Real]Absence check using state equation in 3856 ms returned sat
[2024-05-24 16:22:37] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:22:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 16:22:37] [INFO ] [Real]Absence check using 48 positive place invariants in 68 ms returned sat
[2024-05-24 16:22:38] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 182 ms returned sat
[2024-05-24 16:22:40] [INFO ] [Real]Absence check using state equation in 2199 ms returned sat
[2024-05-24 16:22:40] [INFO ] [Real]Added 1906 Read/Feed constraints in 138 ms returned sat
[2024-05-24 16:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:22:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-24 16:22:41] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 173 ms returned sat
[2024-05-24 16:22:43] [INFO ] [Nat]Absence check using state equation in 2218 ms returned sat
[2024-05-24 16:22:44] [INFO ] [Nat]Added 1906 Read/Feed constraints in 395 ms returned sat
[2024-05-24 16:22:50] [INFO ] Deduced a trap composed of 782 places in 5706 ms of which 241 ms to minimize.
[2024-05-24 16:22:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 16:22:50] [INFO ] [Real]Absence check using 48 positive place invariants in 79 ms returned sat
[2024-05-24 16:22:50] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 48 ms returned unsat
[2024-05-24 16:22:51] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-24 16:22:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 173 ms returned sat
[2024-05-24 16:22:53] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2024-05-24 16:22:54] [INFO ] [Real]Added 1906 Read/Feed constraints in 146 ms returned sat
[2024-05-24 16:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:22:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 69 ms returned sat
[2024-05-24 16:22:55] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 170 ms returned sat
[2024-05-24 16:22:59] [INFO ] [Nat]Absence check using state equation in 4305 ms returned unknown
[2024-05-24 16:22:59] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:23:00] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 170 ms returned sat
[2024-05-24 16:23:03] [INFO ] [Real]Absence check using state equation in 3879 ms returned sat
[2024-05-24 16:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:23:04] [INFO ] [Nat]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-24 16:23:04] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 169 ms returned sat
[2024-05-24 16:23:09] [INFO ] [Nat]Absence check using state equation in 4175 ms returned sat
[2024-05-24 16:23:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:23:09] [INFO ] [Nat]Added 1906 Read/Feed constraints in 170 ms returned unknown
[2024-05-24 16:23:09] [INFO ] [Real]Absence check using 48 positive place invariants in 71 ms returned sat
[2024-05-24 16:23:09] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 159 ms returned sat
[2024-05-24 16:23:13] [INFO ] [Real]Absence check using state equation in 3438 ms returned sat
[2024-05-24 16:23:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:23:14] [INFO ] [Real]Added 1906 Read/Feed constraints in 640 ms returned unknown
[2024-05-24 16:23:14] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:23:14] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 154 ms returned sat
[2024-05-24 16:23:19] [INFO ] [Real]Absence check using state equation in 4137 ms returned sat
[2024-05-24 16:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:23:19] [INFO ] [Nat]Absence check using 48 positive place invariants in 69 ms returned sat
[2024-05-24 16:23:20] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 175 ms returned sat
[2024-05-24 16:23:24] [INFO ] [Nat]Absence check using state equation in 4060 ms returned sat
[2024-05-24 16:23:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:23:24] [INFO ] [Nat]Added 1906 Read/Feed constraints in 190 ms returned unknown
[2024-05-24 16:23:24] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-24 16:23:24] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 167 ms returned sat
[2024-05-24 16:23:29] [INFO ] [Real]Absence check using state equation in 4184 ms returned sat
0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
[2024-05-24 16:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:23:29] [INFO ] [Nat]Absence check using 48 positive place invariants in 69 ms returned sat
[2024-05-24 16:23:30] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 174 ms returned sat
[2024-05-24 16:23:34] [INFO ] [Nat]Absence check using state equation in 4161 ms returned sat
[2024-05-24 16:23:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:23:34] [INFO ] [Nat]Added 1906 Read/Feed constraints in 159 ms returned unknown
[2024-05-24 16:23:34] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-24 16:23:35] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 50 ms returned unsat
[2024-05-24 16:23:35] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-24 16:23:35] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 145 ms returned unsat
[2024-05-24 16:23:36] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-24 16:23:36] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 165 ms returned sat
[2024-05-24 16:23:40] [INFO ] [Real]Absence check using state equation in 3862 ms returned sat
[2024-05-24 16:23:40] [INFO ] [Real]Added 1906 Read/Feed constraints in 143 ms returned sat
[2024-05-24 16:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:23:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 67 ms returned sat
[2024-05-24 16:23:41] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 168 ms returned sat
[2024-05-24 16:23:45] [INFO ] [Nat]Absence check using state equation in 3924 ms returned sat
[2024-05-24 16:23:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:23:45] [INFO ] [Nat]Added 1906 Read/Feed constraints in 409 ms returned unknown
[2024-05-24 16:23:46] [INFO ] [Real]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-24 16:23:46] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 46 ms returned unsat
[2024-05-24 16:23:46] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-24 16:23:46] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 56 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[1, 1, 1, 51, 1, 1, 1, 51, 1, 51, 17, 1, 1, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 1, 51, 1, 51, 17, 51]
Support contains 8 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.20 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1355 transitions
Trivial Post-agglo rules discarded 1355 transitions
Performed 1355 trivial Post agglomeration. Transition count delta: 1355
Iterating post reduction 0 with 1355 rules applied. Total rules applied 1356 place count 4884 transition count 5558
Reduce places removed 1355 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2715 place count 3529 transition count 5554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2719 place count 3525 transition count 5554
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2719 place count 3525 transition count 5384
Deduced a syphon composed of 170 places in 6 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3059 place count 3355 transition count 5384
Discarding 1185 places :
Symmetric choice reduction at 3 with 1185 rule applications. Total rules 4244 place count 2170 transition count 4199
Iterating global reduction 3 with 1185 rules applied. Total rules applied 5429 place count 2170 transition count 4199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5429 place count 2170 transition count 4191
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5445 place count 2162 transition count 4191
Discarding 233 places :
Symmetric choice reduction at 3 with 233 rule applications. Total rules 5678 place count 1929 transition count 3026
Iterating global reduction 3 with 233 rules applied. Total rules applied 5911 place count 1929 transition count 3026
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5945 place count 1912 transition count 3009
Free-agglomeration rule (complex) applied 165 times.
Iterating global reduction 3 with 165 rules applied. Total rules applied 6110 place count 1912 transition count 3776
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 3 with 165 rules applied. Total rules applied 6275 place count 1747 transition count 3776
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6309 place count 1747 transition count 3776
Applied a total of 6309 rules in 1635 ms. Remains 1747 /4914 variables (removed 3167) and now considering 3776/6913 (removed 3137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1647 ms. Remains : 1747/4914 places, 3776/6913 transitions.
[2024-05-24 16:23:48] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
// Phase 1: matrix 3378 rows 1747 cols
[2024-05-24 16:23:48] [INFO ] Computed 505 invariants in 93 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (31864 resets) in 14625 ms. (68 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000005 steps (39684 resets) in 22770 ms. (307 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 0, 1, 1] Max Struct:[2, 1, 1, 2, 1, 2, 2]
[2024-05-24 16:24:26] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
[2024-05-24 16:24:26] [INFO ] Invariant cache hit.
[2024-05-24 16:24:26] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 16:24:26] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 37 ms returned unsat
[2024-05-24 16:24:26] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 16:24:26] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 79 ms returned sat
[2024-05-24 16:24:27] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-05-24 16:24:27] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:24:28] [INFO ] [Real]Added 1906 Read/Feed constraints in 392 ms returned sat
[2024-05-24 16:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:24:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 16:24:28] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 77 ms returned sat
[2024-05-24 16:24:29] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2024-05-24 16:24:31] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1500 ms returned sat
[2024-05-24 16:24:32] [INFO ] Deduced a trap composed of 195 places in 1729 ms of which 21 ms to minimize.
[2024-05-24 16:24:34] [INFO ] Deduced a trap composed of 377 places in 1256 ms of which 11 ms to minimize.
[2024-05-24 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3366 ms
[2024-05-24 16:24:34] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 314 ms.
[2024-05-24 16:24:36] [INFO ] Added : 26 causal constraints over 7 iterations in 2002 ms. Result :sat
Minimization took 7177 ms.
[2024-05-24 16:24:43] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2024-05-24 16:24:44] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 93 ms returned sat
[2024-05-24 16:24:45] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2024-05-24 16:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:24:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 16:24:45] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 82 ms returned sat
[2024-05-24 16:24:46] [INFO ] [Nat]Absence check using state equation in 1058 ms returned sat
[2024-05-24 16:24:48] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1435 ms returned sat
[2024-05-24 16:24:49] [INFO ] Deduced a trap composed of 318 places in 1163 ms of which 12 ms to minimize.
[2024-05-24 16:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1392 ms
[2024-05-24 16:24:49] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 259 ms.
[2024-05-24 16:24:50] [INFO ] Added : 13 causal constraints over 3 iterations in 1214 ms. Result :sat
Minimization took 5557 ms.
[2024-05-24 16:24:56] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 16:24:56] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 76 ms returned unsat
[2024-05-24 16:24:56] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 16:24:56] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 82 ms returned sat
[2024-05-24 16:24:58] [INFO ] [Real]Absence check using state equation in 1310 ms returned sat
[2024-05-24 16:24:58] [INFO ] [Real]Added 1906 Read/Feed constraints in 211 ms returned unsat
[2024-05-24 16:24:58] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-24 16:24:58] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 58 ms returned unsat
[2024-05-24 16:24:58] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-24 16:24:58] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 0, 1, 1] Max Struct:[1, 1, 1, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1747/1747 places, 3776/3776 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1747 transition count 3775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1746 transition count 3775
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1746 transition count 3773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1744 transition count 3773
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 11 place count 1739 transition count 3768
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 1739 transition count 3768
Applied a total of 16 rules in 278 ms. Remains 1739 /1747 variables (removed 8) and now considering 3768/3776 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 1739/1747 places, 3768/3776 transitions.
[2024-05-24 16:24:59] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2024-05-24 16:24:59] [INFO ] Computed 505 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31856 resets) in 14207 ms. (70 steps per ms)
BEST_FIRST walk for 2000001 steps (11338 resets) in 6784 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 16:25:20] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-24 16:25:20] [INFO ] Invariant cache hit.
[2024-05-24 16:25:20] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-24 16:25:20] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 71 ms returned sat
[2024-05-24 16:25:21] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2024-05-24 16:25:21] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:25:21] [INFO ] [Real]Added 1906 Read/Feed constraints in 317 ms returned sat
[2024-05-24 16:25:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:25:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-24 16:25:22] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 91 ms returned sat
[2024-05-24 16:25:23] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2024-05-24 16:25:25] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1933 ms returned sat
[2024-05-24 16:25:26] [INFO ] Deduced a trap composed of 367 places in 1351 ms of which 13 ms to minimize.
[2024-05-24 16:25:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1575 ms
[2024-05-24 16:25:26] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 198 ms.
[2024-05-24 16:25:29] [INFO ] Added : 30 causal constraints over 9 iterations in 2578 ms. Result :sat
Minimization took 6898 ms.
[2024-05-24 16:25:36] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 16:25:36] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 79 ms returned sat
[2024-05-24 16:25:37] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2024-05-24 16:25:37] [INFO ] [Real]Added 1906 Read/Feed constraints in 323 ms returned sat
[2024-05-24 16:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:25:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-24 16:25:38] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 77 ms returned sat
[2024-05-24 16:25:39] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2024-05-24 16:25:40] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1613 ms returned sat
[2024-05-24 16:25:41] [INFO ] Deduced a trap composed of 288 places in 1163 ms of which 11 ms to minimize.
[2024-05-24 16:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1363 ms
[2024-05-24 16:25:42] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 206 ms.
[2024-05-24 16:25:43] [INFO ] Added : 15 causal constraints over 3 iterations in 947 ms. Result :sat
Minimization took 6975 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 112 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1739/1739 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 103 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2024-05-24 16:25:50] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-24 16:25:50] [INFO ] Invariant cache hit.
[2024-05-24 16:25:53] [INFO ] Implicit Places using invariants in 3540 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 449, 450, 451, 452, 453, 454, 460, 464, 466, 468, 470, 472, 485, 491, 493, 494, 495, 496, 497, 498, 500, 502, 504, 506, 510, 516, 523, 529, 530, 531, 532, 533, 534, 538, 540, 542, 544, 546, 548, 561, 567, 569, 570, 571, 572, 573, 574, 576, 578, 580, 582, 584, 588, 593, 597, 598, 599, 600, 601, 602, 604, 606, 608, 610, 612, 614, 627, 633, 635, 636, 637, 638, 639, 640, 642, 644, 646, 648, 650, 652, 655, 657, 658, 659, 660, 661, 662, 664, 666, 668, 670, 672, 674, 687, 693, 695, 696, 697, 698, 699, 700, 702, 704, 706, 708, 710, 712, 714, 716, 717, 718, 719, 720, 721, 723, 725, 727, 729, 731, 733, 746, 748, 751, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 781, 783, 785, 787, 789, 791, 804, 810, 812, 813, 814, 815, 816, 817, 819, 821, 823, 825, 827, 829, 831, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 863, 869, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 890, 893, 894, 895, 896, 897, 898, 900, 902, 904, 906, 908, 910, 923, 929, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 952, 957, 958, 959, 960, 961, 962, 966, 968, 970, 972, 974, 976, 989, 995, 997, 998, 999, 1000, 1001, 1002, 1004, 1006, 1008, 1010, 1012, 1016, 1022, 1029, 1030, 1031, 1032, 1033, 1034, 1040, 1044, 1046, 1048, 1050, 1052, 1065, 1071, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1082, 1084, 1086, 1090, 1096, 1104, 1113, 1114, 1115, 1116, 1117, 1118, 1126, 1132, 1136, 1138, 1140, 1142, 1155, 1161, 1163, 1164, 1165, 1166, 1167, 1168, 1170, 1172, 1174, 1178, 1184, 1192, 1202, 1213, 1214, 1215, 1216, 1217, 1218, 1228, 1236, 1242, 1246, 1248, 1250, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1290, 1298, 1308, 1320, 1333, 1334, 1335, 1336, 1337, 1338, 1350, 1360, 1368, 1374, 1378, 1380, 1393, 1395, 1398, 1400, 1401, 1402, 1403, 1404, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1461, 1476, 1477, 1478, 1479, 1480, 1481, 1495, 1507, 1517, 1525, 1531, 1535, 1548]
[2024-05-24 16:25:53] [INFO ] Actually due to overlaps returned [157, 287, 395, 485, 561, 627, 687, 746, 804, 863, 923, 989, 1065, 1155, 1263, 1393, 1548, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 403, 404, 405, 406, 407, 449, 450, 451, 452, 453, 493, 494, 495, 496, 497, 529, 530, 531, 532, 533, 569, 570, 571, 572, 573, 597, 598, 599, 600, 601, 635, 636, 637, 638, 639, 657, 658, 659, 660, 661, 695, 696, 697, 698, 699, 716, 717, 718, 719, 720, 748, 753, 754, 755, 756, 757, 774, 775, 776, 777, 778, 812, 813, 814, 815, 816, 833, 834, 835, 836, 837, 871, 872, 873, 874, 875, 893, 894, 895, 896, 897, 931, 932, 933, 934, 935, 957, 958, 959, 960, 961, 997, 998, 999, 1000, 1001, 1029, 1030, 1031, 1032, 1033, 1073, 1074, 1075, 1076, 1077, 1113, 1114, 1115, 1116, 1117, 1163, 1164, 1165, 1166, 1167, 1213, 1214, 1215, 1216, 1217, 1271, 1272, 1273, 1274, 1275, 1333, 1334, 1335, 1336, 1337, 1395, 1400, 1401, 1402, 1403, 1404, 1476, 1477, 1478, 1479, 1480]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 3555 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1549/1739 places, 3768/3768 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1389 transition count 3608
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1389 transition count 3608
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1229 transition count 3448
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1229 transition count 3448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1229 transition count 3445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1226 transition count 3445
Applied a total of 646 rules in 263 ms. Remains 1226 /1549 variables (removed 323) and now considering 3445/3768 (removed 323) transitions.
[2024-05-24 16:25:54] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 1226 cols
[2024-05-24 16:25:54] [INFO ] Computed 315 invariants in 23 ms
[2024-05-24 16:25:56] [INFO ] Implicit Places using invariants in 2201 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 328, 332, 334, 336, 338, 346, 348, 350, 352, 354, 358, 364, 372, 381, 389, 395, 399, 401, 403, 405, 407, 415, 417, 419, 421, 423, 425, 429, 435, 442, 448, 452, 454, 456, 458, 460, 462, 470, 472, 474, 476, 478, 480, 482, 486, 491, 495, 497, 499, 501, 503, 505, 507, 515, 517, 519, 521, 523, 525, 527, 529, 532, 534, 536, 538, 540, 542, 544, 546, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 665, 667, 669, 671, 673, 675, 677, 679, 681, 684, 686, 688, 690, 692, 694, 696, 704, 706, 708, 710, 712, 714, 716, 718, 722, 727, 731, 733, 735, 737, 739, 741, 749, 751, 753, 755, 757, 759, 761, 765, 771, 778, 784, 788, 790, 792, 794, 796, 804, 806, 808, 810, 812, 814, 818, 824, 832, 841, 849, 855, 859, 861, 863, 865, 873, 875, 877, 879, 881, 885, 891, 899, 909, 920, 930, 938, 944, 948, 950, 952, 960, 962, 964, 966, 970, 976, 984, 994, 1006, 1019, 1031, 1041, 1049, 1055, 1059, 1061, 1067, 1069, 1071, 1075, 1081, 1089, 1099, 1111, 1125, 1140, 1154, 1166, 1176, 1184, 1190, 1194]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2217 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1739 places, 3445/3768 transitions.
Applied a total of 0 rules in 94 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6239 ms. Remains : 954/1739 places, 3445/3768 transitions.
[2024-05-24 16:25:56] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-24 16:25:56] [INFO ] Computed 43 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (34074 resets) in 13482 ms. (74 steps per ms)
BEST_FIRST walk for 2000002 steps (8064 resets) in 4392 ms. (455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 16:26:14] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:26:14] [INFO ] Invariant cache hit.
[2024-05-24 16:26:14] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:26:14] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:26:15] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2024-05-24 16:26:15] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:26:15] [INFO ] [Real]Added 1906 Read/Feed constraints in 224 ms returned sat
[2024-05-24 16:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:26:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 16:26:15] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:26:16] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-24 16:26:17] [INFO ] [Nat]Added 1906 Read/Feed constraints in 826 ms returned sat
[2024-05-24 16:26:17] [INFO ] Deduced a trap composed of 207 places in 501 ms of which 6 ms to minimize.
[2024-05-24 16:26:18] [INFO ] Deduced a trap composed of 98 places in 544 ms of which 6 ms to minimize.
[2024-05-24 16:26:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1292 ms
[2024-05-24 16:26:18] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 181 ms.
[2024-05-24 16:26:19] [INFO ] Added : 14 causal constraints over 3 iterations in 707 ms. Result :sat
Minimization took 5419 ms.
[2024-05-24 16:26:24] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:26:24] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-24 16:26:25] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-24 16:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:26:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 16:26:25] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:26:26] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-05-24 16:26:26] [INFO ] [Nat]Added 1906 Read/Feed constraints in 831 ms returned sat
[2024-05-24 16:26:27] [INFO ] Deduced a trap composed of 236 places in 470 ms of which 7 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 88 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Deduced a trap composed of 66 places in 530 ms of which 5 ms to minimize.
[2024-05-24 16:26:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1828 ms
[2024-05-24 16:26:28] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 169 ms.
[2024-05-24 16:26:29] [INFO ] Added : 11 causal constraints over 3 iterations in 682 ms. Result :sat
Minimization took 6970 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 119 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 87 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-24 16:26:36] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:26:36] [INFO ] Invariant cache hit.
[2024-05-24 16:26:37] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2024-05-24 16:26:37] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:26:37] [INFO ] Invariant cache hit.
[2024-05-24 16:26:38] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:27:08] [INFO ] Performed 950/954 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 16:27:08] [INFO ] Implicit Places using invariants and state equation in 30989 ms returned []
Implicit Place search using SMT with State Equation took 32132 ms to find 0 implicit places.
[2024-05-24 16:27:08] [INFO ] Redundant transitions in 201 ms returned []
Running 3383 sub problems to find dead transitions.
[2024-05-24 16:27:09] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:27:09] [INFO ] Invariant cache hit.
[2024-05-24 16:27:09] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 47995ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 48062ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80522 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1362 resets) in 1360 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (161 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (158 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 66744 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 66744 steps, saw 27870 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 16:28:00] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:28:00] [INFO ] Invariant cache hit.
[2024-05-24 16:28:00] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:01] [INFO ] Deduced a trap composed of 75 places in 503 ms of which 5 ms to minimize.
[2024-05-24 16:28:02] [INFO ] Deduced a trap composed of 165 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:28:02] [INFO ] Deduced a trap composed of 239 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:28:03] [INFO ] Deduced a trap composed of 209 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:28:03] [INFO ] Deduced a trap composed of 139 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:28:04] [INFO ] Deduced a trap composed of 166 places in 479 ms of which 5 ms to minimize.
[2024-05-24 16:28:04] [INFO ] Deduced a trap composed of 209 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:28:05] [INFO ] Deduced a trap composed of 158 places in 510 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5044ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 82 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1360 resets) in 682 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 68523 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 68523 steps, saw 28606 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 16:28:09] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:28:09] [INFO ] Invariant cache hit.
[2024-05-24 16:28:09] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:09] [INFO ] Deduced a trap composed of 75 places in 456 ms of which 5 ms to minimize.
[2024-05-24 16:28:10] [INFO ] Deduced a trap composed of 165 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:28:11] [INFO ] Deduced a trap composed of 239 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:28:11] [INFO ] Deduced a trap composed of 209 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:28:12] [INFO ] Deduced a trap composed of 139 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:28:12] [INFO ] Deduced a trap composed of 166 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:28:13] [INFO ] Deduced a trap composed of 209 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:28:13] [INFO ] Deduced a trap composed of 158 places in 514 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3047/4001 variables, 954/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4001 variables, 1906/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4001 variables, 0/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/4001 variables, 0/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 2911 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6345 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 954/954 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:16] [INFO ] Deduced a trap composed of 129 places in 501 ms of which 6 ms to minimize.
[2024-05-24 16:28:16] [INFO ] Deduced a trap composed of 175 places in 512 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/916 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:17] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:28:18] [INFO ] Deduced a trap composed of 27 places in 494 ms of which 7 ms to minimize.
[2024-05-24 16:28:18] [INFO ] Deduced a trap composed of 27 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:28:19] [INFO ] Deduced a trap composed of 57 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:28:19] [INFO ] Deduced a trap composed of 46 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:28:20] [INFO ] Deduced a trap composed of 138 places in 481 ms of which 5 ms to minimize.
[2024-05-24 16:28:20] [INFO ] Deduced a trap composed of 123 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:28:21] [INFO ] Deduced a trap composed of 128 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:28:21] [INFO ] Deduced a trap composed of 62 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:28:22] [INFO ] Deduced a trap composed of 149 places in 481 ms of which 5 ms to minimize.
[2024-05-24 16:28:22] [INFO ] Deduced a trap composed of 101 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:28:23] [INFO ] Deduced a trap composed of 118 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:28:23] [INFO ] Deduced a trap composed of 134 places in 546 ms of which 7 ms to minimize.
[2024-05-24 16:28:24] [INFO ] Deduced a trap composed of 129 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:28:24] [INFO ] Deduced a trap composed of 141 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:28:25] [INFO ] Deduced a trap composed of 64 places in 567 ms of which 6 ms to minimize.
[2024-05-24 16:28:25] [INFO ] Deduced a trap composed of 60 places in 555 ms of which 6 ms to minimize.
[2024-05-24 16:28:26] [INFO ] Deduced a trap composed of 69 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:28:27] [INFO ] Deduced a trap composed of 140 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:28:27] [INFO ] Deduced a trap composed of 137 places in 538 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:28] [INFO ] Deduced a trap composed of 61 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:28:28] [INFO ] Deduced a trap composed of 130 places in 561 ms of which 7 ms to minimize.
[2024-05-24 16:28:29] [INFO ] Deduced a trap composed of 94 places in 562 ms of which 6 ms to minimize.
[2024-05-24 16:28:29] [INFO ] Deduced a trap composed of 62 places in 577 ms of which 6 ms to minimize.
[2024-05-24 16:28:30] [INFO ] Deduced a trap composed of 63 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:28:31] [INFO ] Deduced a trap composed of 65 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:28:31] [INFO ] Deduced a trap composed of 70 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:28:32] [INFO ] Deduced a trap composed of 69 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:28:32] [INFO ] Deduced a trap composed of 71 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:28:33] [INFO ] Deduced a trap composed of 79 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:28:33] [INFO ] Deduced a trap composed of 95 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:28:34] [INFO ] Deduced a trap composed of 64 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:28:34] [INFO ] Deduced a trap composed of 67 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:28:35] [INFO ] Deduced a trap composed of 66 places in 573 ms of which 6 ms to minimize.
[2024-05-24 16:28:36] [INFO ] Deduced a trap composed of 67 places in 578 ms of which 6 ms to minimize.
[2024-05-24 16:28:36] [INFO ] Deduced a trap composed of 64 places in 571 ms of which 6 ms to minimize.
[2024-05-24 16:28:37] [INFO ] Deduced a trap composed of 68 places in 574 ms of which 6 ms to minimize.
[2024-05-24 16:28:37] [INFO ] Deduced a trap composed of 64 places in 576 ms of which 6 ms to minimize.
[2024-05-24 16:28:38] [INFO ] Deduced a trap composed of 71 places in 568 ms of which 6 ms to minimize.
[2024-05-24 16:28:39] [INFO ] Deduced a trap composed of 62 places in 574 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:39] [INFO ] Deduced a trap composed of 70 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:28:40] [INFO ] Deduced a trap composed of 68 places in 573 ms of which 6 ms to minimize.
[2024-05-24 16:28:40] [INFO ] Deduced a trap composed of 65 places in 559 ms of which 6 ms to minimize.
[2024-05-24 16:28:41] [INFO ] Deduced a trap composed of 67 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:28:41] [INFO ] Deduced a trap composed of 65 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:28:42] [INFO ] Deduced a trap composed of 67 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:28:43] [INFO ] Deduced a trap composed of 65 places in 574 ms of which 7 ms to minimize.
[2024-05-24 16:28:43] [INFO ] Deduced a trap composed of 63 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:28:44] [INFO ] Deduced a trap composed of 65 places in 578 ms of which 6 ms to minimize.
[2024-05-24 16:28:44] [INFO ] Deduced a trap composed of 46 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:28:45] [INFO ] Deduced a trap composed of 72 places in 574 ms of which 6 ms to minimize.
[2024-05-24 16:28:46] [INFO ] Deduced a trap composed of 75 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:28:46] [INFO ] Deduced a trap composed of 71 places in 538 ms of which 6 ms to minimize.
[2024-05-24 16:28:47] [INFO ] Deduced a trap composed of 88 places in 509 ms of which 5 ms to minimize.
[2024-05-24 16:28:47] [INFO ] Deduced a trap composed of 74 places in 537 ms of which 5 ms to minimize.
[2024-05-24 16:28:48] [INFO ] Deduced a trap composed of 58 places in 560 ms of which 7 ms to minimize.
[2024-05-24 16:28:49] [INFO ] Deduced a trap composed of 55 places in 541 ms of which 6 ms to minimize.
[2024-05-24 16:28:49] [INFO ] Deduced a trap composed of 75 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:28:50] [INFO ] Deduced a trap composed of 85 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:28:51] [INFO ] Deduced a trap composed of 99 places in 563 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/916 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:28:51] [INFO ] Deduced a trap composed of 134 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:28:52] [INFO ] Deduced a trap composed of 79 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:28:52] [INFO ] Deduced a trap composed of 69 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:28:53] [INFO ] Deduced a trap composed of 86 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:28:53] [INFO ] Deduced a trap composed of 70 places in 550 ms of which 6 ms to minimize.
[2024-05-24 16:28:54] [INFO ] Deduced a trap composed of 74 places in 553 ms of which 6 ms to minimize.
[2024-05-24 16:28:55] [INFO ] Deduced a trap composed of 84 places in 545 ms of which 6 ms to minimize.
[2024-05-24 16:28:55] [INFO ] Deduced a trap composed of 71 places in 545 ms of which 6 ms to minimize.
[2024-05-24 16:28:56] [INFO ] Deduced a trap composed of 74 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:28:57] [INFO ] Deduced a trap composed of 71 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:28:57] [INFO ] Deduced a trap composed of 68 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:28:58] [INFO ] Deduced a trap composed of 62 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:28:58] [INFO ] Deduced a trap composed of 84 places in 542 ms of which 5 ms to minimize.
[2024-05-24 16:28:59] [INFO ] Deduced a trap composed of 56 places in 538 ms of which 6 ms to minimize.
[2024-05-24 16:28:59] [INFO ] Deduced a trap composed of 135 places in 553 ms of which 6 ms to minimize.
[2024-05-24 16:29:00] [INFO ] Deduced a trap composed of 55 places in 522 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/4001 variables, and 91 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 2/12 constraints, State Equation: 0/954 constraints, ReadFeed: 0/1906 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 86/86 constraints]
After SMT, in 51407ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 99 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 85 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-24 16:29:00] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:29:00] [INFO ] Invariant cache hit.
[2024-05-24 16:29:01] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2024-05-24 16:29:01] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:29:01] [INFO ] Invariant cache hit.
[2024-05-24 16:29:02] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:29:32] [INFO ] Implicit Places using invariants and state equation in 30638 ms returned []
Implicit Place search using SMT with State Equation took 31777 ms to find 0 implicit places.
[2024-05-24 16:29:32] [INFO ] Redundant transitions in 179 ms returned []
Running 3383 sub problems to find dead transitions.
[2024-05-24 16:29:32] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:29:32] [INFO ] Invariant cache hit.
[2024-05-24 16:29:32] [INFO ] State equation strengthened by 1906 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 48497ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 48530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80604 ms. Remains : 954/954 places, 3445/3445 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:30:21] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:30:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (340 resets) in 148 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:30:21] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:30:21] [INFO ] Invariant cache hit.
[2024-05-24 16:30:21] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:30:21] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:30:22] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2024-05-24 16:30:22] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:30:22] [INFO ] [Real]Added 1906 Read/Feed constraints in 256 ms returned sat
[2024-05-24 16:30:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:30:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:30:22] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:30:23] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2024-05-24 16:30:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:30:24] [INFO ] [Nat]Added 1906 Read/Feed constraints in 801 ms returned sat
[2024-05-24 16:30:25] [INFO ] Deduced a trap composed of 207 places in 485 ms of which 7 ms to minimize.
[2024-05-24 16:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 641 ms
[2024-05-24 16:30:25] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 194 ms.
[2024-05-24 16:30:25] [INFO ] Added : 14 causal constraints over 3 iterations in 696 ms. Result :sat
Minimization took 1219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 105 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 952/954 places, 3439/3443 transitions.
[2024-05-24 16:30:27] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2024-05-24 16:30:27] [INFO ] Computed 43 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34073 resets) in 14460 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (4036 resets) in 2350 ms. (425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:30:43] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:30:43] [INFO ] Invariant cache hit.
[2024-05-24 16:30:44] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:30:44] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:30:44] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-24 16:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:30:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 16:30:45] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:30:45] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-05-24 16:30:45] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-24 16:30:46] [INFO ] [Nat]Added 1903 Read/Feed constraints in 835 ms returned sat
[2024-05-24 16:30:47] [INFO ] Deduced a trap composed of 201 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:30:47] [INFO ] Deduced a trap composed of 77 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:30:48] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:30:48] [INFO ] Deduced a trap composed of 67 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:30:49] [INFO ] Deduced a trap composed of 71 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:30:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3039 ms
[2024-05-24 16:30:49] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 185 ms.
[2024-05-24 16:30:51] [INFO ] Added : 30 causal constraints over 9 iterations in 1854 ms. Result :sat
Minimization took 6495 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 99 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 89 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-24 16:30:58] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:30:58] [INFO ] Invariant cache hit.
[2024-05-24 16:30:59] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2024-05-24 16:30:59] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:30:59] [INFO ] Invariant cache hit.
[2024-05-24 16:31:00] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-24 16:31:29] [INFO ] Implicit Places using invariants and state equation in 29915 ms returned []
Implicit Place search using SMT with State Equation took 31006 ms to find 0 implicit places.
[2024-05-24 16:31:29] [INFO ] Redundant transitions in 126 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-24 16:31:29] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:31:29] [INFO ] Invariant cache hit.
[2024-05-24 16:31:29] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 48454ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 48485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79725 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1360 resets) in 824 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 71639 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71639 steps, saw 29883 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:32:21] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:32:21] [INFO ] Invariant cache hit.
[2024-05-24 16:32:21] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:21] [INFO ] Deduced a trap composed of 181 places in 526 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:24] [INFO ] Deduced a trap composed of 80 places in 529 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:24] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 7 ms to minimize.
[2024-05-24 16:32:25] [INFO ] Deduced a trap composed of 27 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:32:25] [INFO ] Deduced a trap composed of 27 places in 513 ms of which 7 ms to minimize.
[2024-05-24 16:32:26] [INFO ] Deduced a trap composed of 57 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:32:26] [INFO ] Deduced a trap composed of 46 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:32:27] [INFO ] Deduced a trap composed of 62 places in 498 ms of which 6 ms to minimize.
[2024-05-24 16:32:27] [INFO ] Deduced a trap composed of 143 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:32:28] [INFO ] Deduced a trap composed of 75 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:32:28] [INFO ] Deduced a trap composed of 163 places in 446 ms of which 5 ms to minimize.
SMT process timed out in 7505ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 91 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1361 resets) in 650 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (159 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (158 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 74208 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 74208 steps, saw 30949 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 16:32:31] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:32:31] [INFO ] Invariant cache hit.
[2024-05-24 16:32:32] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:32] [INFO ] Deduced a trap composed of 181 places in 516 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:34] [INFO ] Deduced a trap composed of 80 places in 531 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:35] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:32:35] [INFO ] Deduced a trap composed of 27 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:32:36] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:32:36] [INFO ] Deduced a trap composed of 57 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:32:37] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:32:37] [INFO ] Deduced a trap composed of 62 places in 466 ms of which 5 ms to minimize.
[2024-05-24 16:32:38] [INFO ] Deduced a trap composed of 143 places in 446 ms of which 6 ms to minimize.
[2024-05-24 16:32:38] [INFO ] Deduced a trap composed of 75 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:32:39] [INFO ] Deduced a trap composed of 163 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:32:39] [INFO ] Deduced a trap composed of 152 places in 479 ms of which 5 ms to minimize.
[2024-05-24 16:32:40] [INFO ] Deduced a trap composed of 161 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:32:40] [INFO ] Deduced a trap composed of 85 places in 506 ms of which 7 ms to minimize.
[2024-05-24 16:32:41] [INFO ] Deduced a trap composed of 92 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:32:41] [INFO ] Deduced a trap composed of 173 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:32:42] [INFO ] Deduced a trap composed of 176 places in 439 ms of which 5 ms to minimize.
[2024-05-24 16:32:42] [INFO ] Deduced a trap composed of 113 places in 478 ms of which 5 ms to minimize.
[2024-05-24 16:32:43] [INFO ] Deduced a trap composed of 101 places in 460 ms of which 6 ms to minimize.
[2024-05-24 16:32:43] [INFO ] Deduced a trap composed of 201 places in 453 ms of which 5 ms to minimize.
[2024-05-24 16:32:44] [INFO ] Deduced a trap composed of 90 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:32:44] [INFO ] Deduced a trap composed of 92 places in 448 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:45] [INFO ] Deduced a trap composed of 115 places in 455 ms of which 5 ms to minimize.
[2024-05-24 16:32:45] [INFO ] Deduced a trap composed of 183 places in 440 ms of which 5 ms to minimize.
[2024-05-24 16:32:46] [INFO ] Deduced a trap composed of 118 places in 437 ms of which 6 ms to minimize.
[2024-05-24 16:32:46] [INFO ] Deduced a trap composed of 94 places in 447 ms of which 5 ms to minimize.
[2024-05-24 16:32:46] [INFO ] Deduced a trap composed of 115 places in 459 ms of which 5 ms to minimize.
[2024-05-24 16:32:47] [INFO ] Deduced a trap composed of 101 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:32:47] [INFO ] Deduced a trap composed of 122 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:32:48] [INFO ] Deduced a trap composed of 159 places in 461 ms of which 5 ms to minimize.
[2024-05-24 16:32:48] [INFO ] Deduced a trap composed of 160 places in 450 ms of which 5 ms to minimize.
[2024-05-24 16:32:49] [INFO ] Deduced a trap composed of 85 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:32:49] [INFO ] Deduced a trap composed of 95 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:32:50] [INFO ] Deduced a trap composed of 134 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:32:50] [INFO ] Deduced a trap composed of 82 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:32:51] [INFO ] Deduced a trap composed of 46 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:32:51] [INFO ] Deduced a trap composed of 62 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:32:52] [INFO ] Deduced a trap composed of 71 places in 475 ms of which 5 ms to minimize.
[2024-05-24 16:32:52] [INFO ] Deduced a trap composed of 176 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:32:53] [INFO ] Deduced a trap composed of 97 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:32:53] [INFO ] Deduced a trap composed of 130 places in 468 ms of which 5 ms to minimize.
[2024-05-24 16:32:54] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:32:54] [INFO ] Deduced a trap composed of 88 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:32:55] [INFO ] Deduced a trap composed of 123 places in 469 ms of which 5 ms to minimize.
[2024-05-24 16:32:55] [INFO ] Deduced a trap composed of 182 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:32:56] [INFO ] Deduced a trap composed of 165 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:32:56] [INFO ] Deduced a trap composed of 56 places in 498 ms of which 6 ms to minimize.
[2024-05-24 16:32:57] [INFO ] Deduced a trap composed of 74 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:32:57] [INFO ] Deduced a trap composed of 72 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:32:58] [INFO ] Deduced a trap composed of 66 places in 507 ms of which 5 ms to minimize.
[2024-05-24 16:32:58] [INFO ] Deduced a trap composed of 164 places in 564 ms of which 6 ms to minimize.
[2024-05-24 16:32:59] [INFO ] Deduced a trap composed of 75 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:32:59] [INFO ] Deduced a trap composed of 74 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:33:00] [INFO ] Deduced a trap composed of 54 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:33:00] [INFO ] Deduced a trap composed of 62 places in 512 ms of which 5 ms to minimize.
[2024-05-24 16:33:01] [INFO ] Deduced a trap composed of 104 places in 497 ms of which 5 ms to minimize.
[2024-05-24 16:33:01] [INFO ] Deduced a trap composed of 71 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:33:02] [INFO ] Deduced a trap composed of 85 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:33:03] [INFO ] Deduced a trap composed of 65 places in 506 ms of which 5 ms to minimize.
[2024-05-24 16:33:03] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:33:04] [INFO ] Deduced a trap composed of 68 places in 591 ms of which 7 ms to minimize.
[2024-05-24 16:33:04] [INFO ] Deduced a trap composed of 62 places in 520 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:33:05] [INFO ] Deduced a trap composed of 66 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:33:05] [INFO ] Deduced a trap composed of 68 places in 491 ms of which 5 ms to minimize.
[2024-05-24 16:33:06] [INFO ] Deduced a trap composed of 69 places in 517 ms of which 5 ms to minimize.
[2024-05-24 16:33:06] [INFO ] Deduced a trap composed of 66 places in 570 ms of which 6 ms to minimize.
[2024-05-24 16:33:07] [INFO ] Deduced a trap composed of 66 places in 565 ms of which 6 ms to minimize.
[2024-05-24 16:33:07] [INFO ] Deduced a trap composed of 70 places in 498 ms of which 5 ms to minimize.
[2024-05-24 16:33:08] [INFO ] Deduced a trap composed of 64 places in 502 ms of which 5 ms to minimize.
[2024-05-24 16:33:09] [INFO ] Deduced a trap composed of 65 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:33:09] [INFO ] Deduced a trap composed of 59 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:33:10] [INFO ] Deduced a trap composed of 95 places in 442 ms of which 5 ms to minimize.
[2024-05-24 16:33:10] [INFO ] Deduced a trap composed of 72 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:33:11] [INFO ] Deduced a trap composed of 92 places in 438 ms of which 6 ms to minimize.
[2024-05-24 16:33:11] [INFO ] Deduced a trap composed of 55 places in 512 ms of which 5 ms to minimize.
[2024-05-24 16:33:12] [INFO ] Deduced a trap composed of 60 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:33:12] [INFO ] Deduced a trap composed of 74 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:33:13] [INFO ] Deduced a trap composed of 66 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:33:13] [INFO ] Deduced a trap composed of 55 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:33:14] [INFO ] Deduced a trap composed of 55 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:33:14] [INFO ] Deduced a trap composed of 67 places in 497 ms of which 5 ms to minimize.
[2024-05-24 16:33:15] [INFO ] Deduced a trap composed of 57 places in 562 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:33:15] [INFO ] Deduced a trap composed of 67 places in 495 ms of which 5 ms to minimize.
[2024-05-24 16:33:16] [INFO ] Deduced a trap composed of 92 places in 508 ms of which 5 ms to minimize.
[2024-05-24 16:33:16] [INFO ] Deduced a trap composed of 85 places in 563 ms of which 6 ms to minimize.
[2024-05-24 16:33:17] [INFO ] Deduced a trap composed of 68 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:33:18] [INFO ] Deduced a trap composed of 130 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:33:18] [INFO ] Deduced a trap composed of 65 places in 549 ms of which 6 ms to minimize.
[2024-05-24 16:33:19] [INFO ] Deduced a trap composed of 58 places in 608 ms of which 6 ms to minimize.
SMT process timed out in 47293ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 83 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 82 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-24 16:33:19] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:33:19] [INFO ] Invariant cache hit.
[2024-05-24 16:33:20] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-24 16:33:20] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:33:20] [INFO ] Invariant cache hit.
[2024-05-24 16:33:21] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-24 16:33:50] [INFO ] Implicit Places using invariants and state equation in 30332 ms returned []
Implicit Place search using SMT with State Equation took 31475 ms to find 0 implicit places.
[2024-05-24 16:33:51] [INFO ] Redundant transitions in 126 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-24 16:33:51] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:33:51] [INFO ] Invariant cache hit.
[2024-05-24 16:33:51] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 48605ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 48634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80341 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 258400 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:34:39] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-24 16:34:39] [INFO ] Computed 43 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 132 ms. (75 steps per ms)
BEST_FIRST walk for 10001 steps (39 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:34:39] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:34:39] [INFO ] Invariant cache hit.
[2024-05-24 16:34:40] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 16:34:40] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:34:40] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-24 16:34:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:34:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 16:34:40] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:34:41] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-24 16:34:41] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:34:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:34:42] [INFO ] [Nat]Added 1906 Read/Feed constraints in 751 ms returned sat
[2024-05-24 16:34:42] [INFO ] Deduced a trap composed of 236 places in 435 ms of which 5 ms to minimize.
[2024-05-24 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 603 ms
[2024-05-24 16:34:43] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 185 ms.
[2024-05-24 16:34:43] [INFO ] Added : 12 causal constraints over 3 iterations in 727 ms. Result :sat
Minimization took 1217 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 951 transition count 3437
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 950 transition count 3435
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 949 transition count 3433
Applied a total of 5 rules in 109 ms. Remains 949 /954 variables (removed 5) and now considering 3433/3443 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 949/954 places, 3433/3443 transitions.
[2024-05-24 16:34:44] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
// Phase 1: matrix 3035 rows 949 cols
[2024-05-24 16:34:45] [INFO ] Computed 43 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34081 resets) in 13145 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (4032 resets) in 2163 ms. (462 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:35:00] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:35:00] [INFO ] Invariant cache hit.
[2024-05-24 16:35:00] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:35:00] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:35:01] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2024-05-24 16:35:01] [INFO ] State equation strengthened by 1900 read => feed constraints.
[2024-05-24 16:35:01] [INFO ] [Real]Added 1900 Read/Feed constraints in 307 ms returned sat
[2024-05-24 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:35:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:35:01] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-24 16:35:02] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-24 16:35:03] [INFO ] [Nat]Added 1900 Read/Feed constraints in 590 ms returned sat
[2024-05-24 16:35:03] [INFO ] Deduced a trap composed of 242 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:35:04] [INFO ] Deduced a trap composed of 88 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:35:04] [INFO ] Deduced a trap composed of 93 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:35:05] [INFO ] Deduced a trap composed of 66 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2370 ms
[2024-05-24 16:35:05] [INFO ] Computed and/alt/rep : 1320/1898/1320 causal constraints (skipped 1653 transitions) in 162 ms.
[2024-05-24 16:35:05] [INFO ] Added : 10 causal constraints over 2 iterations in 558 ms. Result :sat
Minimization took 5253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 84 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 949/949 places, 3433/3433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 77 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
[2024-05-24 16:35:11] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:35:11] [INFO ] Invariant cache hit.
[2024-05-24 16:35:12] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-24 16:35:12] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:35:12] [INFO ] Invariant cache hit.
[2024-05-24 16:35:13] [INFO ] State equation strengthened by 1900 read => feed constraints.
[2024-05-24 16:35:41] [INFO ] Implicit Places using invariants and state equation in 28483 ms returned []
Implicit Place search using SMT with State Equation took 29637 ms to find 0 implicit places.
[2024-05-24 16:35:41] [INFO ] Redundant transitions in 123 ms returned []
Running 3371 sub problems to find dead transitions.
[2024-05-24 16:35:41] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:35:41] [INFO ] Invariant cache hit.
[2024-05-24 16:35:41] [INFO ] State equation strengthened by 1900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3371 unsolved
SMT process timed out in 51273ms, After SMT, problems are : Problem set: 0 solved, 3371 unsolved
Search for dead transitions found 0 dead transitions in 51302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81157 ms. Remains : 949/949 places, 3433/3433 transitions.
RANDOM walk for 40000 steps (1363 resets) in 769 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 69841 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 69841 steps, saw 29146 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:36:35] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:36:35] [INFO ] Invariant cache hit.
[2024-05-24 16:36:35] [INFO ] State equation strengthened by 1900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:36:36] [INFO ] Deduced a trap composed of 152 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:36:37] [INFO ] Deduced a trap composed of 133 places in 519 ms of which 5 ms to minimize.
[2024-05-24 16:36:37] [INFO ] Deduced a trap composed of 229 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:36:38] [INFO ] Deduced a trap composed of 175 places in 497 ms of which 5 ms to minimize.
[2024-05-24 16:36:38] [INFO ] Deduced a trap composed of 143 places in 500 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/949 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3035/3984 variables, 949/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3984 variables, 1900/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 2897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 949/949 constraints, ReadFeed: 1900/1900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:36:40] [INFO ] Deduced a trap composed of 5 places in 567 ms of which 6 ms to minimize.
[2024-05-24 16:36:41] [INFO ] Deduced a trap composed of 27 places in 550 ms of which 6 ms to minimize.
[2024-05-24 16:36:42] [INFO ] Deduced a trap composed of 46 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:36:42] [INFO ] Deduced a trap composed of 69 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:36:43] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:36:43] [INFO ] Deduced a trap composed of 62 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:36:44] [INFO ] Deduced a trap composed of 85 places in 546 ms of which 5 ms to minimize.
[2024-05-24 16:36:44] [INFO ] Deduced a trap composed of 65 places in 569 ms of which 6 ms to minimize.
[2024-05-24 16:36:45] [INFO ] Deduced a trap composed of 58 places in 558 ms of which 6 ms to minimize.
SMT process timed out in 9568ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 84 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 949/949 places, 3433/3433 transitions.
RANDOM walk for 40000 steps (1362 resets) in 640 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 73662 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73662 steps, saw 30722 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 16:36:48] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:36:48] [INFO ] Invariant cache hit.
[2024-05-24 16:36:48] [INFO ] State equation strengthened by 1900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:36:49] [INFO ] Deduced a trap composed of 152 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:36:50] [INFO ] Deduced a trap composed of 133 places in 541 ms of which 6 ms to minimize.
[2024-05-24 16:36:50] [INFO ] Deduced a trap composed of 229 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:36:51] [INFO ] Deduced a trap composed of 175 places in 540 ms of which 5 ms to minimize.
[2024-05-24 16:36:51] [INFO ] Deduced a trap composed of 143 places in 538 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/949 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3035/3984 variables, 949/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3984 variables, 1900/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 2897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4357 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 949/949 constraints, ReadFeed: 1900/1900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:36:53] [INFO ] Deduced a trap composed of 5 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:36:54] [INFO ] Deduced a trap composed of 27 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:36:54] [INFO ] Deduced a trap composed of 46 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:36:55] [INFO ] Deduced a trap composed of 69 places in 578 ms of which 6 ms to minimize.
[2024-05-24 16:36:56] [INFO ] Deduced a trap composed of 75 places in 571 ms of which 6 ms to minimize.
[2024-05-24 16:36:56] [INFO ] Deduced a trap composed of 62 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:36:57] [INFO ] Deduced a trap composed of 85 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:36:57] [INFO ] Deduced a trap composed of 65 places in 571 ms of which 6 ms to minimize.
[2024-05-24 16:36:58] [INFO ] Deduced a trap composed of 58 places in 577 ms of which 6 ms to minimize.
[2024-05-24 16:36:59] [INFO ] Deduced a trap composed of 123 places in 562 ms of which 6 ms to minimize.
[2024-05-24 16:36:59] [INFO ] Deduced a trap composed of 65 places in 563 ms of which 7 ms to minimize.
[2024-05-24 16:37:00] [INFO ] Deduced a trap composed of 58 places in 579 ms of which 6 ms to minimize.
[2024-05-24 16:37:00] [INFO ] Deduced a trap composed of 73 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:37:01] [INFO ] Deduced a trap composed of 94 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:37:01] [INFO ] Deduced a trap composed of 232 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:37:02] [INFO ] Deduced a trap composed of 168 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:37:02] [INFO ] Deduced a trap composed of 117 places in 537 ms of which 6 ms to minimize.
[2024-05-24 16:37:03] [INFO ] Deduced a trap composed of 171 places in 584 ms of which 6 ms to minimize.
[2024-05-24 16:37:04] [INFO ] Deduced a trap composed of 92 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:37:04] [INFO ] Deduced a trap composed of 131 places in 519 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:37:05] [INFO ] Deduced a trap composed of 69 places in 524 ms of which 8 ms to minimize.
[2024-05-24 16:37:05] [INFO ] Deduced a trap composed of 85 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:37:06] [INFO ] Deduced a trap composed of 66 places in 587 ms of which 6 ms to minimize.
[2024-05-24 16:37:06] [INFO ] Deduced a trap composed of 63 places in 564 ms of which 6 ms to minimize.
[2024-05-24 16:37:07] [INFO ] Deduced a trap composed of 95 places in 534 ms of which 5 ms to minimize.
[2024-05-24 16:37:08] [INFO ] Deduced a trap composed of 149 places in 584 ms of which 6 ms to minimize.
[2024-05-24 16:37:08] [INFO ] Deduced a trap composed of 59 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:37:09] [INFO ] Deduced a trap composed of 82 places in 552 ms of which 5 ms to minimize.
[2024-05-24 16:37:09] [INFO ] Deduced a trap composed of 103 places in 550 ms of which 7 ms to minimize.
[2024-05-24 16:37:10] [INFO ] Deduced a trap composed of 90 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:37:11] [INFO ] Deduced a trap composed of 27 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:37:11] [INFO ] Deduced a trap composed of 78 places in 581 ms of which 6 ms to minimize.
[2024-05-24 16:37:12] [INFO ] Deduced a trap composed of 88 places in 568 ms of which 6 ms to minimize.
[2024-05-24 16:37:12] [INFO ] Deduced a trap composed of 136 places in 565 ms of which 6 ms to minimize.
[2024-05-24 16:37:13] [INFO ] Deduced a trap composed of 88 places in 557 ms of which 5 ms to minimize.
[2024-05-24 16:37:13] [INFO ] Deduced a trap composed of 117 places in 576 ms of which 6 ms to minimize.
[2024-05-24 16:37:14] [INFO ] Deduced a trap composed of 57 places in 570 ms of which 6 ms to minimize.
[2024-05-24 16:37:15] [INFO ] Deduced a trap composed of 104 places in 574 ms of which 6 ms to minimize.
[2024-05-24 16:37:15] [INFO ] Deduced a trap composed of 70 places in 526 ms of which 6 ms to minimize.
[2024-05-24 16:37:16] [INFO ] Deduced a trap composed of 222 places in 596 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:37:16] [INFO ] Deduced a trap composed of 127 places in 584 ms of which 6 ms to minimize.
[2024-05-24 16:37:17] [INFO ] Deduced a trap composed of 73 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:37:18] [INFO ] Deduced a trap composed of 85 places in 581 ms of which 6 ms to minimize.
[2024-05-24 16:37:18] [INFO ] Deduced a trap composed of 62 places in 544 ms of which 6 ms to minimize.
[2024-05-24 16:37:19] [INFO ] Deduced a trap composed of 113 places in 558 ms of which 6 ms to minimize.
[2024-05-24 16:37:19] [INFO ] Deduced a trap composed of 58 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:37:20] [INFO ] Deduced a trap composed of 94 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:37:20] [INFO ] Deduced a trap composed of 94 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:37:21] [INFO ] Deduced a trap composed of 46 places in 560 ms of which 6 ms to minimize.
[2024-05-24 16:37:22] [INFO ] Deduced a trap composed of 62 places in 577 ms of which 6 ms to minimize.
[2024-05-24 16:37:22] [INFO ] Deduced a trap composed of 161 places in 569 ms of which 6 ms to minimize.
[2024-05-24 16:37:23] [INFO ] Deduced a trap composed of 57 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:37:23] [INFO ] Deduced a trap composed of 66 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:37:24] [INFO ] Deduced a trap composed of 57 places in 567 ms of which 6 ms to minimize.
[2024-05-24 16:37:25] [INFO ] Deduced a trap composed of 60 places in 571 ms of which 6 ms to minimize.
[2024-05-24 16:37:25] [INFO ] Deduced a trap composed of 88 places in 582 ms of which 6 ms to minimize.
[2024-05-24 16:37:26] [INFO ] Deduced a trap composed of 63 places in 577 ms of which 6 ms to minimize.
[2024-05-24 16:37:26] [INFO ] Deduced a trap composed of 85 places in 580 ms of which 6 ms to minimize.
[2024-05-24 16:37:27] [INFO ] Deduced a trap composed of 71 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:37:27] [INFO ] Deduced a trap composed of 97 places in 567 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:37:28] [INFO ] Deduced a trap composed of 62 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:37:29] [INFO ] Deduced a trap composed of 120 places in 561 ms of which 6 ms to minimize.
[2024-05-24 16:37:29] [INFO ] Deduced a trap composed of 85 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:37:30] [INFO ] Deduced a trap composed of 70 places in 539 ms of which 6 ms to minimize.
[2024-05-24 16:37:30] [INFO ] Deduced a trap composed of 93 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:37:31] [INFO ] Deduced a trap composed of 58 places in 500 ms of which 5 ms to minimize.
[2024-05-24 16:37:31] [INFO ] Deduced a trap composed of 76 places in 576 ms of which 7 ms to minimize.
[2024-05-24 16:37:32] [INFO ] Deduced a trap composed of 67 places in 596 ms of which 6 ms to minimize.
[2024-05-24 16:37:33] [INFO ] Deduced a trap composed of 106 places in 564 ms of which 8 ms to minimize.
[2024-05-24 16:37:33] [INFO ] Deduced a trap composed of 85 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:37:34] [INFO ] Deduced a trap composed of 59 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:37:34] [INFO ] Deduced a trap composed of 67 places in 557 ms of which 6 ms to minimize.
[2024-05-24 16:37:35] [INFO ] Deduced a trap composed of 87 places in 548 ms of which 5 ms to minimize.
[2024-05-24 16:37:36] [INFO ] Deduced a trap composed of 69 places in 537 ms of which 5 ms to minimize.
[2024-05-24 16:37:36] [INFO ] Deduced a trap composed of 71 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:37:37] [INFO ] Deduced a trap composed of 75 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:37:37] [INFO ] Deduced a trap composed of 85 places in 515 ms of which 5 ms to minimize.
[2024-05-24 16:37:38] [INFO ] Deduced a trap composed of 103 places in 539 ms of which 6 ms to minimize.
SMT process timed out in 49568ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 82 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 949/949 places, 3433/3433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 80 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
[2024-05-24 16:37:38] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:37:38] [INFO ] Invariant cache hit.
[2024-05-24 16:37:39] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2024-05-24 16:37:39] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:37:39] [INFO ] Invariant cache hit.
[2024-05-24 16:37:40] [INFO ] State equation strengthened by 1900 read => feed constraints.
[2024-05-24 16:38:10] [INFO ] Performed 948/949 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 16:38:10] [INFO ] Implicit Places using invariants and state equation in 31145 ms returned []
Implicit Place search using SMT with State Equation took 32279 ms to find 0 implicit places.
[2024-05-24 16:38:10] [INFO ] Redundant transitions in 131 ms returned []
Running 3371 sub problems to find dead transitions.
[2024-05-24 16:38:10] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:38:10] [INFO ] Invariant cache hit.
[2024-05-24 16:38:10] [INFO ] State equation strengthened by 1900 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3371 unsolved
SMT process timed out in 50039ms, After SMT, problems are : Problem set: 0 solved, 3371 unsolved
Search for dead transitions found 0 dead transitions in 50071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82587 ms. Remains : 949/949 places, 3433/3433 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 in 261218 ms.
[2024-05-24 16:39:01] [INFO ] Flatten gal took : 307 ms
[2024-05-24 16:39:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 16:39:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 954 places, 3445 transitions and 17172 arcs took 22 ms.
Total runtime 993305 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 954
TRANSITIONS: 3445
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.082s, Sys 0.015s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.012s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1807
MODEL NAME: /home/mcc/execution/414/model
954 places, 3445 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r245-tall-171654349000029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;