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.r517-tall-167987243800357.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 itstools
Input is Murphy-PT-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243800357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680938154248

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2023-04-08 07:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-08 07:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:15:56] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-04-08 07:15:56] [INFO ] Transformed 24 places.
[2023-04-08 07:15:56] [INFO ] Transformed 28 transitions.
[2023-04-08 07:15:56] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:15:56] [INFO ] Computed 5 invariants in 11 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :466
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :316
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :251
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :221
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :243
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :249
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :222
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :233
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :157
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :357
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :209
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :297
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :319
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :345
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :191
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :239
[2023-04-08 07:15:56] [INFO ] Invariant cache hit.
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-04-08 07:15:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-04-08 07:15:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:15:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-04-08 07:15:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-08 07:15:56] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 27 ms.
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-04-08 07:15:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:15:56] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-08 07:15:57] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:57] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:15:57] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:15:57] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:57] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 35 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 20 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 21 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 26 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 21 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:15:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 20 ms.
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-04-08 07:15:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 6 ms to minimize.
[2023-04-08 07:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-08 07:15:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 8 ms.
[2023-04-08 07:15:58] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-04-08 07:15:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-08 07:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:15:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:15:58] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:15:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:15:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:15:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-04-08 07:15:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:15:58] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [204, -1, -1, -1, -1, -1, -1, 204, 204, 204, 204, 204, 204, -1, -1, 204] Max seen :[93, 1, 3, 3, 3, 3, 1, 73, 104, 101, 93, 93, 104, 2, 2, 93]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 16 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:15:59] [INFO ] Invariant cache hit.
[2023-04-08 07:15:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-08 07:15:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 16) seen :536
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 16) seen :269
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 16) seen :444
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 16) seen :719
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 16) seen :854
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 16) seen :789
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 16) seen :443
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 16) seen :676
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 16) seen :173
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 16) seen :480
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 16) seen :324
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 16) seen :260
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 16) seen :349
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 16) seen :683
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=1908 ) properties (out of 16) seen :799
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 16) seen :309
[2023-04-08 07:16:08] [INFO ] Invariant cache hit.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-04-08 07:16:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:08] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-04-08 07:16:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2023-04-08 07:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-08 07:16:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:08] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2023-04-08 07:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-08 07:16:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:09] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 19 ms.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:16:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:16:09] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:16:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:09] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-04-08 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [201, -1, -1, -1, -1, -1, -1, 204, 201, 204, 201, 201, 201, -1, -1, 201] Max seen :[201, 1, 3, 3, 3, 3, 1, 199, 201, 199, 201, 201, 201, 2, 2, 201]
FORMULA Murphy-PT-D3N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-12 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-11 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-10 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-00 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-08 07:16:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 10) seen :163
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 10) seen :120
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 10) seen :119
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 10) seen :126
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 10) seen :133
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 10) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 10) seen :122
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 10) seen :143
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 10) seen :147
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 10) seen :130
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 10) seen :126
[2023-04-08 07:16:15] [INFO ] Invariant cache hit.
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-04-08 07:16:15] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:16:15] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:15] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:16] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-04-08 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:16] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-04-08 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:16] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 16 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-08 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-08 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:16:16] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:16:16] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, 204, 204, -1, -1] Max seen :[1, 3, 3, 3, 3, 1, 199, 199, 2, 2]
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:16] [INFO ] Invariant cache hit.
[2023-04-08 07:16:17] [INFO ] Implicit Places using invariants in 37 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43 ms. Remains : 20/24 places, 28/28 transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:17] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 10) seen :152
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 10) seen :130
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 10) seen :124
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 10) seen :123
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 10) seen :141
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 10) seen :120
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 10) seen :140
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 10) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 10) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 10) seen :123
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 10) seen :126
[2023-04-08 07:16:22] [INFO ] Invariant cache hit.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:22] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:22] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:22] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:22] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:22] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:22] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:22] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 17 ms.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:22] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 21 ms.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:23] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:16:23] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, 204, 204, -1, -1] Max seen :[1, 3, 3, 3, 3, 1, 199, 199, 2, 2]
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
[2023-04-08 07:16:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
[2023-04-08 07:16:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-08 07:16:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
[2023-04-08 07:16:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 20/20 places, 28/28 transitions.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-01
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:23] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:23] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 1) seen :1
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
[2023-04-08 07:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:25] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2023-04-08 07:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:16:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:16:25] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
[2023-04-08 07:16:25] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
[2023-04-08 07:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:25] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-04-08 07:16:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
[2023-04-08 07:16:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-01 in 2020 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:25] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10020 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
[2023-04-08 07:16:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-04-08 07:16:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:25] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:25] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:25] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 1) seen :3
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
[2023-04-08 07:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:16:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:27] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
[2023-04-08 07:16:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
[2023-04-08 07:16:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-08 07:16:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
[2023-04-08 07:16:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-02 in 2027 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:27] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
[2023-04-08 07:16:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:27] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:27] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 3 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:27] [INFO ] Computed 0 invariants in 1 ms
[2023-04-08 07:16:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 1) seen :3
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
[2023-04-08 07:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:16:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:16:29] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:29] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
[2023-04-08 07:16:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
[2023-04-08 07:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:29] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-08 07:16:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
[2023-04-08 07:16:29] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-03 in 2009 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-04
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:29] [INFO ] Computed 1 invariants in 5 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
[2023-04-08 07:16:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:29] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:29] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 1) seen :3
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
[2023-04-08 07:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:31] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:16:31] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
[2023-04-08 07:16:31] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
[2023-04-08 07:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-08 07:16:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
[2023-04-08 07:16:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-04 in 1983 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-05
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:31] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
[2023-04-08 07:16:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:31] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 3 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:31] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 1) seen :3
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
[2023-04-08 07:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:16:33] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:16:33] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
[2023-04-08 07:16:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
[2023-04-08 07:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-08 07:16:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
[2023-04-08 07:16:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-05 in 2001 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-06
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:33] [INFO ] Computed 1 invariants in 2 ms
Incomplete random walk after 10048 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1116 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
[2023-04-08 07:16:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:33] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:33] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:33] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:33] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :1
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:35] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:16:35] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:35] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 07:16:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-06 in 1985 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:35] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :57
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :89
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:35] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:35] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:35] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-08 07:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:16:35] [INFO ] Added : 4 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[89]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
[2023-04-08 07:16:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 20/20 places, 28/28 transitions.
[2023-04-08 07:16:35] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 1) seen :64
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 1) seen :123
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
[2023-04-08 07:16:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-04-08 07:16:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:36] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[199]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
[2023-04-08 07:16:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
[2023-04-08 07:16:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:36] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-08 07:16:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
[2023-04-08 07:16:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 20/20 places, 28/28 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-07 in 1563 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-09
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1671 ) properties (out of 1) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :69
[2023-04-08 07:16:36] [INFO ] Invariant cache hit.
[2023-04-08 07:16:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:37] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[69]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:37] [INFO ] Invariant cache hit.
[2023-04-08 07:16:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 20/20 places, 28/28 transitions.
[2023-04-08 07:16:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 1) seen :63
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 1) seen :59
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
[2023-04-08 07:16:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:16:38] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[199]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
[2023-04-08 07:16:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
[2023-04-08 07:16:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:16:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
[2023-04-08 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 20/20 places, 28/28 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-09 in 1484 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-13
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
[2023-04-08 07:16:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:16:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:16:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:38] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 4 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:38] [INFO ] Computed 0 invariants in 1 ms
[2023-04-08 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 1) seen :2
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
[2023-04-08 07:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-04-08 07:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:16:40] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:16:40] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
[2023-04-08 07:16:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
[2023-04-08 07:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:40] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-04-08 07:16:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
[2023-04-08 07:16:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-13 in 2067 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-14
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:16:40] [INFO ] Computed 1 invariants in 3 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
[2023-04-08 07:16:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:16:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:16:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:16:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:16:40] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:16:40] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-08 07:16:40] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:16:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 3/20 places, 4/28 transitions.
[2023-04-08 07:16:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 1) seen :2
[2023-04-08 07:16:42] [INFO ] Invariant cache hit.
[2023-04-08 07:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:16:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-04-08 07:16:42] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:16:42] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-04-08 07:16:42] [INFO ] Invariant cache hit.
[2023-04-08 07:16:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-08 07:16:42] [INFO ] Invariant cache hit.
[2023-04-08 07:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-08 07:16:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-04-08 07:16:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:16:42] [INFO ] Invariant cache hit.
[2023-04-08 07:16:42] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-14 in 2059 ms.
[2023-04-08 07:16:42] [INFO ] Flatten gal took : 21 ms
[2023-04-08 07:16:42] [INFO ] Applying decomposition
[2023-04-08 07:16:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12439046010399886641.txt' '-o' '/tmp/graph12439046010399886641.bin' '-w' '/tmp/graph12439046010399886641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12439046010399886641.bin' '-l' '-1' '-v' '-w' '/tmp/graph12439046010399886641.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:16:42] [INFO ] Decomposing Gal with order
[2023-04-08 07:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:16:42] [INFO ] Flatten gal took : 31 ms
[2023-04-08 07:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-08 07:16:42] [INFO ] Time to serialize gal into /tmp/UpperBounds4793243636147851109.gal : 2 ms
[2023-04-08 07:16:42] [INFO ] Time to serialize properties into /tmp/UpperBounds15308960114550805502.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4793243636147851109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15308960114550805502.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15308960114550805502.prop.
Detected timeout of ITS tools.
[2023-04-08 07:36:58] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:36:58] [INFO ] Time to serialize gal into /tmp/UpperBounds3302226506416902965.gal : 1 ms
[2023-04-08 07:36:58] [INFO ] Time to serialize properties into /tmp/UpperBounds9572699512918270559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3302226506416902965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9572699512918270559.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds9572699512918270559.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.4071e+14,54.5765,716212,2,7445,5,2.50568e+06,6,0,139,2.74917e+06,0
Total reachable state count : 540710084330928

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D3N050-UpperBounds-01 :0 <= p3_3 <= 1
FORMULA Murphy-PT-D3N050-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-01,0,54.5839,716212,1,0,7,2.50568e+06,9,1,178,2.74917e+06,4
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-02 :0 <= p5_1 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-02 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-02,0,54.638,716212,1,0,8,2.50568e+06,10,1,221,2.74917e+06,5
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-03 :0 <= p5_2 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-03 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-03,0,54.6655,716212,1,0,9,2.50568e+06,11,1,248,2.74917e+06,6
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-04 :0 <= p5_4 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-04,0,54.6656,716212,1,0,10,2.50568e+06,12,1,255,2.74917e+06,7
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-05 :0 <= p5_3 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-05 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-05,0,54.6708,716212,1,0,11,2.50568e+06,13,1,272,2.74917e+06,8
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D3N050-UpperBounds-06 :0 <= p3_4 <= 1
FORMULA Murphy-PT-D3N050-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-06,0,54.6709,716212,1,0,12,2.50568e+06,14,1,279,2.74917e+06,9
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-07 :0 <= p1_2 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-07 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-07,0,54.8237,716212,1,0,13,2.50568e+06,15,1,508,2.74917e+06,10
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-09 :0 <= p1_3 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-09 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-09,0,54.8816,716212,1,0,14,2.50568e+06,16,1,727,2.74917e+06,11
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D3N050-UpperBounds-13 :0 <= p4_1 <= 2
FORMULA Murphy-PT-D3N050-UpperBounds-13 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-13,0,54.9557,716212,1,0,15,2.50568e+06,17,1,767,2.74917e+06,12
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D3N050-UpperBounds-14 :0 <= p4_4 <= 2
FORMULA Murphy-PT-D3N050-UpperBounds-14 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-14,0,54.9559,716212,1,0,16,2.50568e+06,18,1,777,2.74917e+06,13
Total runtime 1317040 ms.

BK_STOP 1680939474308

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Murphy-PT-D3N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Murphy-PT-D3N050, 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 r517-tall-167987243800357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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