MCC'2023- Execution of r297-tall-167873950900765

About the Execution of LTSMin+red for PolyORBNT-PT-S10J30

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1605.436	3600000.00	13190614.00	1173.40	1 2 1 1 4 10 1 1 3 ? 1 1 1 1 ? 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679640809343

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:53:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 06:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:53:31] [INFO ] Load time of PNML (sax parser for PT used): 619 ms
[2023-03-24 06:53:32] [INFO ] Transformed 664 places.
[2023-03-24 06:53:32] [INFO ] Transformed 12050 transitions.
[2023-03-24 06:53:32] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 771 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 06:53:32] [INFO ] Computed 92 place invariants in 157 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 559 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :20
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :13
[2023-03-24 06:53:33] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 06:53:33] [INFO ] Computed 92 place invariants in 85 ms
[2023-03-24 06:53:33] [INFO ] [Real]Absence check using 63 positive place invariants in 29 ms returned sat
[2023-03-24 06:53:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 29 ms returned unsat
[2023-03-24 06:53:33] [INFO ] [Real]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-24 06:53:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-24 06:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:34] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2023-03-24 06:53:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:53:34] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 06:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:38] [INFO ] [Nat]Absence check using state equation in 3462 ms returned sat
[2023-03-24 06:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2023-03-24 06:53:38] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 259 ms.
[2023-03-24 06:53:39] [INFO ] Added : 31 causal constraints over 7 iterations in 935 ms. Result :sat
Minimization took 353 ms.
[2023-03-24 06:53:39] [INFO ] [Real]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-24 06:53:39] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 15 ms returned unsat
[2023-03-24 06:53:39] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:53:39] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:40] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-24 06:53:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:53:40] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:41] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2023-03-24 06:53:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 249 ms returned sat
[2023-03-24 06:53:42] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 148 ms.
[2023-03-24 06:53:45] [INFO ] Added : 5 causal constraints over 1 iterations in 3376 ms. Result :unknown
[2023-03-24 06:53:45] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:53:45] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using state equation in 463 ms returned unsat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned unsat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:53:46] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 30 ms returned sat
[2023-03-24 06:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:47] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2023-03-24 06:53:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:47] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-24 06:53:47] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 37 ms returned sat
[2023-03-24 06:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:48] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2023-03-24 06:53:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 06:53:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 3676 ms returned unknown
[2023-03-24 06:53:52] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:53:52] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:53] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2023-03-24 06:53:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:53] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:53:53] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:55] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2023-03-24 06:53:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 180 ms returned sat
[2023-03-24 06:53:55] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 165 ms.
[2023-03-24 06:53:55] [INFO ] Added : 12 causal constraints over 3 iterations in 507 ms. Result :sat
Minimization took 839 ms.
[2023-03-24 06:53:56] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:53:56] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 91 ms returned sat
[2023-03-24 06:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:57] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2023-03-24 06:53:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:53:57] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-24 06:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:02] [INFO ] [Nat]Absence check using state equation in 4885 ms returned unknown
[2023-03-24 06:54:02] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:54:02] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 15 ms returned unsat
[2023-03-24 06:54:02] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:54:02] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-24 06:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:03] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2023-03-24 06:54:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:54:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2023-03-24 06:54:04] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-24 06:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:05] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2023-03-24 06:54:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 458 ms returned sat
[2023-03-24 06:54:05] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 150 ms.
[2023-03-24 06:54:06] [INFO ] Added : 12 causal constraints over 3 iterations in 504 ms. Result :sat
Minimization took 1531 ms.
Current structural bounds on expressions (after SMT) : [1, 151, 1, 280, 10, 1, 1, 226, 302, 4, 1, 302] Max seen :[1, 0, 1, 1, 10, 1, 1, 0, 1, 0, 1, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 376 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2023-03-24 06:54:08] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2023-03-24 06:54:08] [INFO ] Computed 82 place invariants in 49 ms
[2023-03-24 06:54:09] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 581/664 places, 1252/1940 transitions.
Applied a total of 0 rules in 48 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1505 ms. Remains : 581/664 places, 1252/1940 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:54:09] [INFO ] Computed 82 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 70307 resets, run finished after 8687 ms. (steps per millisecond=115 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8743 resets, run finished after 1669 ms. (steps per millisecond=599 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 6111 resets, run finished after 1702 ms. (steps per millisecond=587 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8819 resets, run finished after 1676 ms. (steps per millisecond=596 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8664 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 8860 resets, run finished after 1696 ms. (steps per millisecond=589 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8862 resets, run finished after 1702 ms. (steps per millisecond=587 ) properties (out of 6) seen :14
[2023-03-24 06:54:28] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:54:28] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive place invariants in 26 ms returned sat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 7 ms returned unsat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 6 ms returned unsat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:54:28] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned sat
[2023-03-24 06:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:30] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2023-03-24 06:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:54:30] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:54:30] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 06:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:30] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2023-03-24 06:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1137 ms returned sat
[2023-03-24 06:54:32] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 6 ms to minimize.
[2023-03-24 06:54:32] [INFO ] Deduced a trap composed of 216 places in 338 ms of which 2 ms to minimize.
[2023-03-24 06:54:33] [INFO ] Deduced a trap composed of 243 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:54:33] [INFO ] Deduced a trap composed of 236 places in 344 ms of which 2 ms to minimize.
[2023-03-24 06:54:33] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:54:34] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:54:34] [INFO ] Deduced a trap composed of 222 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:54:35] [INFO ] Deduced a trap composed of 240 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:54:35] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:54:36] [INFO ] Deduced a trap composed of 228 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:54:36] [INFO ] Deduced a trap composed of 226 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:54:36] [INFO ] Deduced a trap composed of 234 places in 362 ms of which 1 ms to minimize.
[2023-03-24 06:54:37] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 1 ms to minimize.
[2023-03-24 06:54:37] [INFO ] Deduced a trap composed of 228 places in 354 ms of which 0 ms to minimize.
[2023-03-24 06:54:38] [INFO ] Deduced a trap composed of 239 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:54:39] [INFO ] Deduced a trap composed of 228 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:54:40] [INFO ] Deduced a trap composed of 230 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:54:40] [INFO ] Deduced a trap composed of 222 places in 337 ms of which 5 ms to minimize.
[2023-03-24 06:54:41] [INFO ] Deduced a trap composed of 238 places in 358 ms of which 0 ms to minimize.
[2023-03-24 06:54:42] [INFO ] Deduced a trap composed of 226 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:54:42] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 0 ms to minimize.
[2023-03-24 06:54:43] [INFO ] Deduced a trap composed of 216 places in 362 ms of which 1 ms to minimize.
[2023-03-24 06:54:43] [INFO ] Deduced a trap composed of 230 places in 359 ms of which 0 ms to minimize.
[2023-03-24 06:54:43] [INFO ] Deduced a trap composed of 224 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:54:44] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:54:45] [INFO ] Deduced a trap composed of 226 places in 352 ms of which 0 ms to minimize.
[2023-03-24 06:54:45] [INFO ] Deduced a trap composed of 228 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:54:45] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:54:46] [INFO ] Deduced a trap composed of 238 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:54:47] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:54:47] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:54:47] [INFO ] Deduced a trap composed of 243 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:54:48] [INFO ] Deduced a trap composed of 238 places in 332 ms of which 0 ms to minimize.
[2023-03-24 06:54:48] [INFO ] Deduced a trap composed of 238 places in 350 ms of which 1 ms to minimize.
[2023-03-24 06:54:49] [INFO ] Deduced a trap composed of 234 places in 316 ms of which 0 ms to minimize.
[2023-03-24 06:54:49] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:54:49] [INFO ] Deduced a trap composed of 234 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:54:50] [INFO ] Deduced a trap composed of 230 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:54:50] [INFO ] Deduced a trap composed of 242 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:54:51] [INFO ] Deduced a trap composed of 230 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:54:51] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:54:52] [INFO ] Deduced a trap composed of 237 places in 357 ms of which 0 ms to minimize.
[2023-03-24 06:54:52] [INFO ] Deduced a trap composed of 244 places in 329 ms of which 0 ms to minimize.
[2023-03-24 06:54:53] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 0 ms to minimize.
[2023-03-24 06:54:53] [INFO ] Deduced a trap composed of 230 places in 350 ms of which 0 ms to minimize.
[2023-03-24 06:54:53] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:54:54] [INFO ] Deduced a trap composed of 224 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:54:54] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:54:55] [INFO ] Deduced a trap composed of 228 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:54:55] [INFO ] Deduced a trap composed of 222 places in 335 ms of which 0 ms to minimize.
[2023-03-24 06:54:56] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 2 ms to minimize.
[2023-03-24 06:54:57] [INFO ] Deduced a trap composed of 226 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:54:57] [INFO ] Deduced a trap composed of 226 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:54:57] [INFO ] Deduced a trap composed of 234 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:54:58] [INFO ] Deduced a trap composed of 228 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:54:58] [INFO ] Deduced a trap composed of 229 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:54:59] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:54:59] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:55:00] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:55:00] [INFO ] Deduced a trap composed of 228 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:55:00] [INFO ] Deduced a trap composed of 234 places in 310 ms of which 0 ms to minimize.
[2023-03-24 06:55:01] [INFO ] Deduced a trap composed of 236 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:55:01] [INFO ] Deduced a trap composed of 242 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:55:02] [INFO ] Deduced a trap composed of 222 places in 313 ms of which 1 ms to minimize.
[2023-03-24 06:55:02] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:55:02] [INFO ] Deduced a trap composed of 234 places in 328 ms of which 0 ms to minimize.
[2023-03-24 06:55:03] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 2 ms to minimize.
[2023-03-24 06:55:03] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 2 ms to minimize.
[2023-03-24 06:55:04] [INFO ] Deduced a trap composed of 242 places in 366 ms of which 0 ms to minimize.
[2023-03-24 06:55:04] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:55:06] [INFO ] Deduced a trap composed of 226 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:55:07] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:55:07] [INFO ] Deduced a trap composed of 232 places in 355 ms of which 0 ms to minimize.
[2023-03-24 06:55:08] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:55:08] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:55:09] [INFO ] Deduced a trap composed of 236 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:55:09] [INFO ] Deduced a trap composed of 228 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:55:10] [INFO ] Deduced a trap composed of 231 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:55:10] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:55:11] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:55:11] [INFO ] Deduced a trap composed of 234 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:55:11] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:55:12] [INFO ] Deduced a trap composed of 239 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:55:15] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 43139 ms
[2023-03-24 06:55:15] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:55:15] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 3 ms returned unsat
[2023-03-24 06:55:15] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2023-03-24 06:55:15] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:55:16] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2023-03-24 06:55:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:55:16] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:55:16] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned sat
[2023-03-24 06:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:55:17] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2023-03-24 06:55:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 459 ms returned sat
[2023-03-24 06:55:18] [INFO ] Deduced a trap composed of 250 places in 342 ms of which 0 ms to minimize.
[2023-03-24 06:55:18] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:55:19] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:55:19] [INFO ] Deduced a trap composed of 238 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:55:19] [INFO ] Deduced a trap composed of 237 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:55:20] [INFO ] Deduced a trap composed of 241 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:55:20] [INFO ] Deduced a trap composed of 222 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:55:21] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:55:21] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 1 ms to minimize.
[2023-03-24 06:55:21] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:55:22] [INFO ] Deduced a trap composed of 249 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:55:22] [INFO ] Deduced a trap composed of 233 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:55:23] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:55:23] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:55:24] [INFO ] Deduced a trap composed of 230 places in 354 ms of which 0 ms to minimize.
[2023-03-24 06:55:24] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 0 ms to minimize.
[2023-03-24 06:55:25] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:55:25] [INFO ] Deduced a trap composed of 234 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:55:25] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:55:26] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:55:26] [INFO ] Deduced a trap composed of 230 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:55:27] [INFO ] Deduced a trap composed of 251 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:55:28] [INFO ] Deduced a trap composed of 253 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:55:28] [INFO ] Deduced a trap composed of 228 places in 326 ms of which 0 ms to minimize.
[2023-03-24 06:55:29] [INFO ] Deduced a trap composed of 241 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:55:29] [INFO ] Deduced a trap composed of 230 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:55:29] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:55:30] [INFO ] Deduced a trap composed of 225 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:55:30] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:55:31] [INFO ] Deduced a trap composed of 226 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:55:31] [INFO ] Deduced a trap composed of 238 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:55:32] [INFO ] Deduced a trap composed of 226 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:55:32] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:55:32] [INFO ] Deduced a trap composed of 229 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:55:33] [INFO ] Deduced a trap composed of 233 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:55:33] [INFO ] Deduced a trap composed of 232 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:55:34] [INFO ] Deduced a trap composed of 230 places in 361 ms of which 1 ms to minimize.
[2023-03-24 06:55:34] [INFO ] Deduced a trap composed of 229 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:55:35] [INFO ] Deduced a trap composed of 241 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:55:35] [INFO ] Deduced a trap composed of 224 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:55:36] [INFO ] Deduced a trap composed of 245 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:55:36] [INFO ] Deduced a trap composed of 232 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:55:38] [INFO ] Deduced a trap composed of 232 places in 329 ms of which 0 ms to minimize.
[2023-03-24 06:55:38] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:55:39] [INFO ] Deduced a trap composed of 230 places in 358 ms of which 1 ms to minimize.
[2023-03-24 06:55:39] [INFO ] Deduced a trap composed of 238 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:55:40] [INFO ] Deduced a trap composed of 237 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:55:40] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:55:41] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:55:41] [INFO ] Deduced a trap composed of 230 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:55:42] [INFO ] Deduced a trap composed of 239 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:55:42] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:55:43] [INFO ] Deduced a trap composed of 230 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:55:43] [INFO ] Deduced a trap composed of 228 places in 362 ms of which 1 ms to minimize.
[2023-03-24 06:55:44] [INFO ] Deduced a trap composed of 232 places in 363 ms of which 1 ms to minimize.
[2023-03-24 06:55:44] [INFO ] Deduced a trap composed of 224 places in 361 ms of which 0 ms to minimize.
[2023-03-24 06:55:44] [INFO ] Deduced a trap composed of 234 places in 350 ms of which 1 ms to minimize.
[2023-03-24 06:55:45] [INFO ] Deduced a trap composed of 234 places in 359 ms of which 0 ms to minimize.
[2023-03-24 06:55:45] [INFO ] Deduced a trap composed of 238 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:55:46] [INFO ] Deduced a trap composed of 250 places in 354 ms of which 1 ms to minimize.
[2023-03-24 06:55:46] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:55:47] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:55:47] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:55:48] [INFO ] Deduced a trap composed of 244 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:55:49] [INFO ] Deduced a trap composed of 248 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:55:51] [INFO ] Deduced a trap composed of 237 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:55:52] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:55:52] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:55:53] [INFO ] Deduced a trap composed of 240 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:55:54] [INFO ] Deduced a trap composed of 243 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:55:54] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 0 ms to minimize.
[2023-03-24 06:55:55] [INFO ] Deduced a trap composed of 241 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:55:55] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 0 ms to minimize.
[2023-03-24 06:55:56] [INFO ] Deduced a trap composed of 231 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:55:59] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 41143 ms
Current structural bounds on expressions (after SMT) : [2, 4, 3, 60, 1, 60] Max seen :[2, 4, 3, 3, 1, 3]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 38 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:55:59] [INFO ] Computed 82 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 70456 resets, run finished after 8208 ms. (steps per millisecond=121 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8922 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8921 resets, run finished after 1644 ms. (steps per millisecond=608 ) properties (out of 2) seen :4
[2023-03-24 06:56:10] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:56:10] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-24 06:56:10] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:56:11] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 06:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:56:12] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2023-03-24 06:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:56:12] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:56:12] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-24 06:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:56:12] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2023-03-24 06:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:56:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1137 ms returned sat
[2023-03-24 06:56:14] [INFO ] Deduced a trap composed of 234 places in 310 ms of which 0 ms to minimize.
[2023-03-24 06:56:14] [INFO ] Deduced a trap composed of 216 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:56:15] [INFO ] Deduced a trap composed of 243 places in 345 ms of which 0 ms to minimize.
[2023-03-24 06:56:15] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:56:16] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:56:16] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:56:16] [INFO ] Deduced a trap composed of 222 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:56:17] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:56:17] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:56:18] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:56:18] [INFO ] Deduced a trap composed of 226 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:56:18] [INFO ] Deduced a trap composed of 234 places in 333 ms of which 0 ms to minimize.
[2023-03-24 06:56:19] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:56:19] [INFO ] Deduced a trap composed of 228 places in 329 ms of which 0 ms to minimize.
[2023-03-24 06:56:20] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:56:21] [INFO ] Deduced a trap composed of 228 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:56:22] [INFO ] Deduced a trap composed of 230 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:56:22] [INFO ] Deduced a trap composed of 222 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:56:23] [INFO ] Deduced a trap composed of 238 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:56:24] [INFO ] Deduced a trap composed of 226 places in 318 ms of which 0 ms to minimize.
[2023-03-24 06:56:24] [INFO ] Deduced a trap composed of 234 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:56:24] [INFO ] Deduced a trap composed of 216 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:56:25] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 0 ms to minimize.
[2023-03-24 06:56:25] [INFO ] Deduced a trap composed of 224 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:56:26] [INFO ] Deduced a trap composed of 234 places in 361 ms of which 0 ms to minimize.
[2023-03-24 06:56:27] [INFO ] Deduced a trap composed of 226 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:56:27] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:56:27] [INFO ] Deduced a trap composed of 230 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:56:28] [INFO ] Deduced a trap composed of 238 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:56:29] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:56:29] [INFO ] Deduced a trap composed of 230 places in 358 ms of which 1 ms to minimize.
[2023-03-24 06:56:29] [INFO ] Deduced a trap composed of 243 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:56:30] [INFO ] Deduced a trap composed of 238 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:56:30] [INFO ] Deduced a trap composed of 238 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:56:31] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:56:31] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 1 ms to minimize.
[2023-03-24 06:56:31] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:56:32] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:56:32] [INFO ] Deduced a trap composed of 242 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:56:33] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:56:33] [INFO ] Deduced a trap composed of 232 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:56:34] [INFO ] Deduced a trap composed of 237 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:56:34] [INFO ] Deduced a trap composed of 244 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:56:35] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:56:35] [INFO ] Deduced a trap composed of 230 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:56:35] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:56:36] [INFO ] Deduced a trap composed of 224 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:56:36] [INFO ] Deduced a trap composed of 236 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:56:37] [INFO ] Deduced a trap composed of 228 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:56:37] [INFO ] Deduced a trap composed of 222 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:56:38] [INFO ] Deduced a trap composed of 232 places in 358 ms of which 1 ms to minimize.
[2023-03-24 06:56:39] [INFO ] Deduced a trap composed of 226 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:56:39] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:56:39] [INFO ] Deduced a trap composed of 234 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:56:40] [INFO ] Deduced a trap composed of 228 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:56:40] [INFO ] Deduced a trap composed of 229 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:56:41] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:56:41] [INFO ] Deduced a trap composed of 232 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:56:42] [INFO ] Deduced a trap composed of 230 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:56:42] [INFO ] Deduced a trap composed of 228 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:56:42] [INFO ] Deduced a trap composed of 234 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:56:43] [INFO ] Deduced a trap composed of 236 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:56:43] [INFO ] Deduced a trap composed of 242 places in 340 ms of which 0 ms to minimize.
[2023-03-24 06:56:44] [INFO ] Deduced a trap composed of 222 places in 351 ms of which 0 ms to minimize.
[2023-03-24 06:56:44] [INFO ] Deduced a trap composed of 228 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:56:45] [INFO ] Deduced a trap composed of 234 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:56:45] [INFO ] Deduced a trap composed of 226 places in 359 ms of which 0 ms to minimize.
[2023-03-24 06:56:45] [INFO ] Deduced a trap composed of 234 places in 342 ms of which 0 ms to minimize.
[2023-03-24 06:56:46] [INFO ] Deduced a trap composed of 242 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:56:46] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:56:49] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 0 ms to minimize.
[2023-03-24 06:56:49] [INFO ] Deduced a trap composed of 230 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:56:49] [INFO ] Deduced a trap composed of 232 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:56:50] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:56:50] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:56:51] [INFO ] Deduced a trap composed of 236 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:56:51] [INFO ] Deduced a trap composed of 228 places in 319 ms of which 0 ms to minimize.
[2023-03-24 06:56:52] [INFO ] Deduced a trap composed of 231 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:56:52] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:56:53] [INFO ] Deduced a trap composed of 234 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:56:53] [INFO ] Deduced a trap composed of 234 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:56:54] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:56:54] [INFO ] Deduced a trap composed of 239 places in 345 ms of which 0 ms to minimize.
[2023-03-24 06:56:57] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 43134 ms
[2023-03-24 06:56:57] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:56:57] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:56:58] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2023-03-24 06:56:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:56:58] [INFO ] [Nat]Absence check using 63 positive place invariants in 19 ms returned sat
[2023-03-24 06:56:58] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:56:59] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-24 06:57:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 486 ms returned sat
[2023-03-24 06:57:00] [INFO ] Deduced a trap composed of 250 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:57:00] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:57:01] [INFO ] Deduced a trap composed of 228 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:57:01] [INFO ] Deduced a trap composed of 238 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:57:02] [INFO ] Deduced a trap composed of 237 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:57:02] [INFO ] Deduced a trap composed of 241 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:57:02] [INFO ] Deduced a trap composed of 222 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:57:03] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:57:03] [INFO ] Deduced a trap composed of 232 places in 348 ms of which 3 ms to minimize.
[2023-03-24 06:57:03] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 0 ms to minimize.
[2023-03-24 06:57:04] [INFO ] Deduced a trap composed of 249 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:57:04] [INFO ] Deduced a trap composed of 233 places in 360 ms of which 0 ms to minimize.
[2023-03-24 06:57:05] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:57:05] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:57:06] [INFO ] Deduced a trap composed of 230 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:57:06] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 2 ms to minimize.
[2023-03-24 06:57:07] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:57:07] [INFO ] Deduced a trap composed of 234 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:57:07] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:57:08] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:57:08] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:57:09] [INFO ] Deduced a trap composed of 251 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:57:10] [INFO ] Deduced a trap composed of 253 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:57:10] [INFO ] Deduced a trap composed of 228 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:57:11] [INFO ] Deduced a trap composed of 241 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:57:11] [INFO ] Deduced a trap composed of 230 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:57:11] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:57:12] [INFO ] Deduced a trap composed of 225 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:57:12] [INFO ] Deduced a trap composed of 232 places in 363 ms of which 1 ms to minimize.
[2023-03-24 06:57:13] [INFO ] Deduced a trap composed of 226 places in 359 ms of which 0 ms to minimize.
[2023-03-24 06:57:13] [INFO ] Deduced a trap composed of 238 places in 358 ms of which 1 ms to minimize.
[2023-03-24 06:57:14] [INFO ] Deduced a trap composed of 226 places in 356 ms of which 1 ms to minimize.
[2023-03-24 06:57:14] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 0 ms to minimize.
[2023-03-24 06:57:15] [INFO ] Deduced a trap composed of 229 places in 350 ms of which 0 ms to minimize.
[2023-03-24 06:57:15] [INFO ] Deduced a trap composed of 233 places in 357 ms of which 0 ms to minimize.
[2023-03-24 06:57:15] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:57:16] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:57:17] [INFO ] Deduced a trap composed of 229 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:57:17] [INFO ] Deduced a trap composed of 241 places in 354 ms of which 1 ms to minimize.
[2023-03-24 06:57:18] [INFO ] Deduced a trap composed of 224 places in 361 ms of which 1 ms to minimize.
[2023-03-24 06:57:18] [INFO ] Deduced a trap composed of 245 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:57:18] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:57:20] [INFO ] Deduced a trap composed of 232 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:57:21] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:57:21] [INFO ] Deduced a trap composed of 230 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:57:22] [INFO ] Deduced a trap composed of 238 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:57:22] [INFO ] Deduced a trap composed of 237 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:57:22] [INFO ] Deduced a trap composed of 232 places in 355 ms of which 0 ms to minimize.
[2023-03-24 06:57:23] [INFO ] Deduced a trap composed of 230 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:57:23] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:57:24] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:57:24] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:57:25] [INFO ] Deduced a trap composed of 230 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:57:25] [INFO ] Deduced a trap composed of 228 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:57:26] [INFO ] Deduced a trap composed of 232 places in 340 ms of which 0 ms to minimize.
[2023-03-24 06:57:26] [INFO ] Deduced a trap composed of 224 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:57:27] [INFO ] Deduced a trap composed of 234 places in 363 ms of which 1 ms to minimize.
[2023-03-24 06:57:27] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:57:27] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:57:28] [INFO ] Deduced a trap composed of 250 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:57:28] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:57:29] [INFO ] Deduced a trap composed of 228 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:57:29] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:57:30] [INFO ] Deduced a trap composed of 244 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:57:31] [INFO ] Deduced a trap composed of 248 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:57:33] [INFO ] Deduced a trap composed of 237 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:57:34] [INFO ] Deduced a trap composed of 228 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:57:34] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 0 ms to minimize.
[2023-03-24 06:57:35] [INFO ] Deduced a trap composed of 240 places in 356 ms of which 0 ms to minimize.
[2023-03-24 06:57:36] [INFO ] Deduced a trap composed of 243 places in 364 ms of which 1 ms to minimize.
[2023-03-24 06:57:36] [INFO ] Deduced a trap composed of 234 places in 340 ms of which 0 ms to minimize.
[2023-03-24 06:57:37] [INFO ] Deduced a trap composed of 241 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:57:37] [INFO ] Deduced a trap composed of 245 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:57:38] [INFO ] Deduced a trap composed of 231 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:57:41] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 41146 ms
Current structural bounds on expressions (after SMT) : [60, 60] Max seen :[3, 3]
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 34 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 06:57:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:57:41] [INFO ] Invariant cache hit.
[2023-03-24 06:57:42] [INFO ] Implicit Places using invariants in 822 ms returned []
[2023-03-24 06:57:42] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:57:42] [INFO ] Invariant cache hit.
[2023-03-24 06:57:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:57:49] [INFO ] Implicit Places using invariants and state equation in 7685 ms returned []
Implicit Place search using SMT with State Equation took 8507 ms to find 0 implicit places.
[2023-03-24 06:57:50] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-24 06:57:50] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:57:50] [INFO ] Invariant cache hit.
[2023-03-24 06:57:50] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9415 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:57:50] [INFO ] Computed 82 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 698 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-24 06:57:50] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:57:50] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-24 06:57:51] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:57:51] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:57:52] [INFO ] [Real]Absence check using state equation in 1267 ms returned sat
[2023-03-24 06:57:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:57:52] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:57:52] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 15 ms returned sat
[2023-03-24 06:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:57:53] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2023-03-24 06:57:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:57:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1203 ms returned sat
[2023-03-24 06:57:54] [INFO ] Deduced a trap composed of 234 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:57:55] [INFO ] Deduced a trap composed of 216 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:57:55] [INFO ] Deduced a trap composed of 243 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:57:55] [INFO ] Deduced a trap composed of 236 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:57:56] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:57:56] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:57:57] [INFO ] Deduced a trap composed of 222 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:57:57] [INFO ] Deduced a trap composed of 240 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:57:57] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 35 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 06:57:57] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:57:57] [INFO ] Invariant cache hit.
[2023-03-24 06:57:58] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 849 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:57:58] [INFO ] Computed 82 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 70434 resets, run finished after 8363 ms. (steps per millisecond=119 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 8820 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 1) seen :3
[2023-03-24 06:58:08] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:58:08] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-24 06:58:08] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:58:08] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:58:09] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2023-03-24 06:58:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:58:09] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:58:09] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2023-03-24 06:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:58:10] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2023-03-24 06:58:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:58:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1163 ms returned sat
[2023-03-24 06:58:12] [INFO ] Deduced a trap composed of 234 places in 368 ms of which 1 ms to minimize.
[2023-03-24 06:58:12] [INFO ] Deduced a trap composed of 216 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:58:12] [INFO ] Deduced a trap composed of 243 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:58:13] [INFO ] Deduced a trap composed of 236 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:58:13] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:58:14] [INFO ] Deduced a trap composed of 234 places in 314 ms of which 0 ms to minimize.
[2023-03-24 06:58:14] [INFO ] Deduced a trap composed of 222 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:58:14] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:58:15] [INFO ] Deduced a trap composed of 230 places in 312 ms of which 0 ms to minimize.
[2023-03-24 06:58:15] [INFO ] Deduced a trap composed of 228 places in 318 ms of which 1 ms to minimize.
[2023-03-24 06:58:16] [INFO ] Deduced a trap composed of 226 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:58:16] [INFO ] Deduced a trap composed of 234 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:58:16] [INFO ] Deduced a trap composed of 232 places in 316 ms of which 1 ms to minimize.
[2023-03-24 06:58:17] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:58:17] [INFO ] Deduced a trap composed of 239 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:58:19] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:58:20] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:58:20] [INFO ] Deduced a trap composed of 222 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:58:21] [INFO ] Deduced a trap composed of 238 places in 356 ms of which 0 ms to minimize.
[2023-03-24 06:58:21] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:58:22] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:58:22] [INFO ] Deduced a trap composed of 216 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:58:23] [INFO ] Deduced a trap composed of 230 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:58:23] [INFO ] Deduced a trap composed of 224 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:58:24] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:58:24] [INFO ] Deduced a trap composed of 226 places in 327 ms of which 0 ms to minimize.
[2023-03-24 06:58:25] [INFO ] Deduced a trap composed of 228 places in 328 ms of which 0 ms to minimize.
[2023-03-24 06:58:25] [INFO ] Deduced a trap composed of 230 places in 358 ms of which 0 ms to minimize.
[2023-03-24 06:58:26] [INFO ] Deduced a trap composed of 238 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:58:26] [INFO ] Deduced a trap composed of 232 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:58:27] [INFO ] Deduced a trap composed of 230 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:58:27] [INFO ] Deduced a trap composed of 243 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:58:27] [INFO ] Deduced a trap composed of 238 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:58:28] [INFO ] Deduced a trap composed of 238 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:58:28] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 0 ms to minimize.
[2023-03-24 06:58:29] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:58:29] [INFO ] Deduced a trap composed of 234 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:58:30] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:58:30] [INFO ] Deduced a trap composed of 242 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:58:31] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:58:31] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 0 ms to minimize.
[2023-03-24 06:58:31] [INFO ] Deduced a trap composed of 237 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:58:32] [INFO ] Deduced a trap composed of 244 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:58:32] [INFO ] Deduced a trap composed of 232 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:58:33] [INFO ] Deduced a trap composed of 230 places in 327 ms of which 0 ms to minimize.
[2023-03-24 06:58:33] [INFO ] Deduced a trap composed of 236 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:58:33] [INFO ] Deduced a trap composed of 224 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:58:34] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:58:34] [INFO ] Deduced a trap composed of 228 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:58:35] [INFO ] Deduced a trap composed of 222 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:58:36] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:58:36] [INFO ] Deduced a trap composed of 226 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:58:37] [INFO ] Deduced a trap composed of 226 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:58:37] [INFO ] Deduced a trap composed of 234 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:58:37] [INFO ] Deduced a trap composed of 228 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:58:38] [INFO ] Deduced a trap composed of 229 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:58:38] [INFO ] Deduced a trap composed of 236 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:58:39] [INFO ] Deduced a trap composed of 232 places in 326 ms of which 0 ms to minimize.
[2023-03-24 06:58:39] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:58:40] [INFO ] Deduced a trap composed of 228 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:58:40] [INFO ] Deduced a trap composed of 234 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:58:40] [INFO ] Deduced a trap composed of 236 places in 324 ms of which 0 ms to minimize.
[2023-03-24 06:58:41] [INFO ] Deduced a trap composed of 242 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:58:41] [INFO ] Deduced a trap composed of 222 places in 328 ms of which 0 ms to minimize.
[2023-03-24 06:58:42] [INFO ] Deduced a trap composed of 228 places in 354 ms of which 0 ms to minimize.
[2023-03-24 06:58:42] [INFO ] Deduced a trap composed of 234 places in 360 ms of which 1 ms to minimize.
[2023-03-24 06:58:43] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:58:43] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:58:43] [INFO ] Deduced a trap composed of 242 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:58:44] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:58:46] [INFO ] Deduced a trap composed of 226 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:58:47] [INFO ] Deduced a trap composed of 230 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:58:47] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:58:47] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:58:48] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:58:48] [INFO ] Deduced a trap composed of 236 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:58:49] [INFO ] Deduced a trap composed of 228 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:58:49] [INFO ] Deduced a trap composed of 231 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:58:50] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:58:50] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:58:51] [INFO ] Deduced a trap composed of 234 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:58:51] [INFO ] Deduced a trap composed of 234 places in 328 ms of which 0 ms to minimize.
[2023-03-24 06:58:52] [INFO ] Deduced a trap composed of 239 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:58:54] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 43103 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 06:58:54] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:58:54] [INFO ] Invariant cache hit.
[2023-03-24 06:58:55] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-24 06:58:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:58:55] [INFO ] Invariant cache hit.
[2023-03-24 06:58:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:59:03] [INFO ] Implicit Places using invariants and state equation in 8318 ms returned []
Implicit Place search using SMT with State Equation took 8982 ms to find 0 implicit places.
[2023-03-24 06:59:03] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-24 06:59:03] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:59:03] [INFO ] Invariant cache hit.
[2023-03-24 06:59:04] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9848 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09 in 73964 ms.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:59:04] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 728 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-24 06:59:04] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:59:04] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-24 06:59:05] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:59:05] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:59:06] [INFO ] [Real]Absence check using state equation in 1266 ms returned sat
[2023-03-24 06:59:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:59:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:59:06] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:59:07] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2023-03-24 06:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:59:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 489 ms returned sat
[2023-03-24 06:59:08] [INFO ] Deduced a trap composed of 250 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:59:08] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:59:08] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:59:09] [INFO ] Deduced a trap composed of 238 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:59:09] [INFO ] Deduced a trap composed of 237 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:59:10] [INFO ] Deduced a trap composed of 241 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:59:10] [INFO ] Deduced a trap composed of 222 places in 336 ms of which 1 ms to minimize.
[2023-03-24 06:59:10] [INFO ] Deduced a trap composed of 234 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:59:11] [INFO ] Deduced a trap composed of 232 places in 319 ms of which 0 ms to minimize.
[2023-03-24 06:59:11] [INFO ] Deduced a trap composed of 234 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:59:11] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 42 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 06:59:11] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:59:11] [INFO ] Invariant cache hit.
[2023-03-24 06:59:12] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:59:12] [INFO ] Computed 82 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 70442 resets, run finished after 8342 ms. (steps per millisecond=119 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8923 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :3
[2023-03-24 06:59:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:59:22] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-24 06:59:22] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-24 06:59:22] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 20 ms returned sat
[2023-03-24 06:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:59:23] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2023-03-24 06:59:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:59:23] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 06:59:23] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-24 06:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:59:24] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2023-03-24 06:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:59:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 487 ms returned sat
[2023-03-24 06:59:25] [INFO ] Deduced a trap composed of 250 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:59:26] [INFO ] Deduced a trap composed of 228 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:59:26] [INFO ] Deduced a trap composed of 228 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:59:26] [INFO ] Deduced a trap composed of 238 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:59:27] [INFO ] Deduced a trap composed of 237 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:59:27] [INFO ] Deduced a trap composed of 241 places in 345 ms of which 0 ms to minimize.
[2023-03-24 06:59:27] [INFO ] Deduced a trap composed of 222 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:59:28] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:59:28] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:59:29] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:59:29] [INFO ] Deduced a trap composed of 249 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:59:29] [INFO ] Deduced a trap composed of 233 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:59:30] [INFO ] Deduced a trap composed of 230 places in 356 ms of which 0 ms to minimize.
[2023-03-24 06:59:31] [INFO ] Deduced a trap composed of 234 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:59:31] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:59:31] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:59:32] [INFO ] Deduced a trap composed of 232 places in 352 ms of which 0 ms to minimize.
[2023-03-24 06:59:32] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:59:33] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:59:33] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:59:33] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:59:35] [INFO ] Deduced a trap composed of 251 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:59:35] [INFO ] Deduced a trap composed of 253 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:59:35] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:59:36] [INFO ] Deduced a trap composed of 241 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:59:36] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:59:37] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:59:37] [INFO ] Deduced a trap composed of 225 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:59:38] [INFO ] Deduced a trap composed of 232 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:59:38] [INFO ] Deduced a trap composed of 226 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:59:38] [INFO ] Deduced a trap composed of 238 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:59:39] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:59:39] [INFO ] Deduced a trap composed of 236 places in 331 ms of which 0 ms to minimize.
[2023-03-24 06:59:40] [INFO ] Deduced a trap composed of 229 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:59:40] [INFO ] Deduced a trap composed of 233 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:59:40] [INFO ] Deduced a trap composed of 232 places in 356 ms of which 0 ms to minimize.
[2023-03-24 06:59:41] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:59:42] [INFO ] Deduced a trap composed of 229 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:59:42] [INFO ] Deduced a trap composed of 241 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:59:43] [INFO ] Deduced a trap composed of 224 places in 335 ms of which 0 ms to minimize.
[2023-03-24 06:59:43] [INFO ] Deduced a trap composed of 245 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:59:43] [INFO ] Deduced a trap composed of 232 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:59:45] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:59:46] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 0 ms to minimize.
[2023-03-24 06:59:46] [INFO ] Deduced a trap composed of 230 places in 352 ms of which 0 ms to minimize.
[2023-03-24 06:59:47] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 1 ms to minimize.
[2023-03-24 06:59:47] [INFO ] Deduced a trap composed of 237 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:59:47] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:59:48] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:59:48] [INFO ] Deduced a trap composed of 230 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:59:49] [INFO ] Deduced a trap composed of 239 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:59:49] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 0 ms to minimize.
[2023-03-24 06:59:49] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:59:50] [INFO ] Deduced a trap composed of 228 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:59:51] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 0 ms to minimize.
[2023-03-24 06:59:51] [INFO ] Deduced a trap composed of 224 places in 333 ms of which 0 ms to minimize.
[2023-03-24 06:59:51] [INFO ] Deduced a trap composed of 234 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:59:52] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:59:52] [INFO ] Deduced a trap composed of 238 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:59:53] [INFO ] Deduced a trap composed of 250 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:59:53] [INFO ] Deduced a trap composed of 230 places in 309 ms of which 0 ms to minimize.
[2023-03-24 06:59:53] [INFO ] Deduced a trap composed of 228 places in 318 ms of which 0 ms to minimize.
[2023-03-24 06:59:54] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:59:55] [INFO ] Deduced a trap composed of 244 places in 357 ms of which 0 ms to minimize.
[2023-03-24 06:59:56] [INFO ] Deduced a trap composed of 248 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:59:58] [INFO ] Deduced a trap composed of 237 places in 329 ms of which 0 ms to minimize.
[2023-03-24 06:59:58] [INFO ] Deduced a trap composed of 228 places in 368 ms of which 0 ms to minimize.
[2023-03-24 06:59:59] [INFO ] Deduced a trap composed of 234 places in 352 ms of which 1 ms to minimize.
[2023-03-24 07:00:00] [INFO ] Deduced a trap composed of 240 places in 336 ms of which 0 ms to minimize.
[2023-03-24 07:00:01] [INFO ] Deduced a trap composed of 243 places in 359 ms of which 1 ms to minimize.
[2023-03-24 07:00:01] [INFO ] Deduced a trap composed of 234 places in 345 ms of which 0 ms to minimize.
[2023-03-24 07:00:02] [INFO ] Deduced a trap composed of 241 places in 344 ms of which 0 ms to minimize.
[2023-03-24 07:00:02] [INFO ] Deduced a trap composed of 245 places in 347 ms of which 0 ms to minimize.
[2023-03-24 07:00:02] [INFO ] Deduced a trap composed of 231 places in 360 ms of which 0 ms to minimize.
[2023-03-24 07:00:05] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 40591 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 07:00:05] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 07:00:05] [INFO ] Invariant cache hit.
[2023-03-24 07:00:06] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-24 07:00:06] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 07:00:06] [INFO ] Invariant cache hit.
[2023-03-24 07:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 07:00:15] [INFO ] Implicit Places using invariants and state equation in 8329 ms returned []
Implicit Place search using SMT with State Equation took 9080 ms to find 0 implicit places.
[2023-03-24 07:00:15] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-24 07:00:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 07:00:15] [INFO ] Invariant cache hit.
[2023-03-24 07:00:15] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9928 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14 in 71117 ms.
[2023-03-24 07:00:16] [INFO ] Flatten gal took : 193 ms
[2023-03-24 07:00:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 07:00:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 581 places, 1252 transitions and 7921 arcs took 11 ms.
Total runtime 405041 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/2175/ub_0_ --maxsum=/tmp/2175/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14513640 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16071672 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J30, 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 r297-tall-167873950900765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 ;