MCC'2024- Execution of r245-tall-171654349600309

About the Execution of GreatSPN+red for Murphy-PT-D2N100

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14180.796	403117.00	1410865.00	353.60	? 2 1 ? 301 301 2 301 ? 1 3 3 1 301 2 301	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.2K Apr 11 23:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 23:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 22:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 22:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 23:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 23:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 23:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 23:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716654732190

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 16:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:32:13] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-25 16:32:13] [INFO ] Transformed 18 places.
[2024-05-25 16:32:13] [INFO ] Transformed 21 transitions.
[2024-05-25 16:32:13] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[100, 0, 0, 100, 1, 1, 0, 1, 100, 0, 3, 3, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[100, 0, 0, 100, 1, 1, 0, 1, 100, 0, 3, 3, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21 rows 18 cols
[2024-05-25 16:32:13] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 0, 0, 100, 1, 1, 0, 1, 100, 0, 3, 3, 0, 1, 0, 1] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
RANDOM walk for 10096 steps (2 resets) in 19 ms. (504 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 108 ms. (1468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[109, 2, 1, 112, 109, 111, 2, 111, 133, 1, 3, 3, 1, 115, 2, 115] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
[2024-05-25 16:32:13] [INFO ] Invariant cache hit.
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:32:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:32:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:13] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:32:13] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:32:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:13] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:13] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:14] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 20 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 19 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:14] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 19 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:15] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 14 ms to minimize.
[2024-05-25 16:32:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-25 16:32:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:15] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:15] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[109, 2, 1, 112, 109, 111, 2, 111, 133, 1, 3, 3, 1, 115, 2, 115] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[202, 2, 1, 287, 301, 299, 2, 299, 201, 1, 3, 3, 1, 301, 2, 301] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:15] [INFO ] Invariant cache hit.
[2024-05-25 16:32:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 18/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {10=1, 13=1, 19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {10=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :[104, 2, 1, 104, 123, 161, 2, 161, 104, 1, 3, 3, 1, 128, 2, 128]
Current structural bounds on expressions (after cover walk) : Max Seen:[202, 2, 1, 287, 301, 299, 2, 299, 201, 1, 3, 3, 1, 301, 2, 301] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
[2024-05-25 16:32:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[202, 2, 1, 287, 301, 299, 2, 299, 201, 1, 3, 3, 1, 301, 2, 301] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
RANDOM walk for 1000045 steps (2 resets) in 306 ms. (3257 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 5189 ms. (3082 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202, 2, 1, 287, 301, 301, 2, 301, 201, 1, 3, 3, 1, 301, 2, 301] Max Struct:[303, +inf, +inf, 303, 303, 303, +inf, 303, 303, +inf, +inf, +inf, +inf, 303, +inf, 303]
[2024-05-25 16:32:21] [INFO ] Invariant cache hit.
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:32:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-05-25 16:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-25 16:32:21] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:21] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:21] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:21] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:21] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:22] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:22] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:22] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:22] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:22] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-25 16:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-25 16:32:22] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:32:22] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[202, 2, 1, 287, 301, 301, 2, 301, 201, 1, 3, 3, 1, 301, 2, 301] Max Struct:[303, +inf, +inf, 303, 301, 301, +inf, 301, 303, +inf, +inf, +inf, +inf, 301, +inf, 301]
FORMULA Murphy-PT-D2N100-UpperBounds-15 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-13 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-07 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-05 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-04 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {10=1, 13=1, 19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {10=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :[102, 2, 1, 103, 2, 105, 1, 3, 3, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 16:32:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 268 ms. (3717 steps per ms)
BEST_FIRST walk for 11000006 steps (22 resets) in 3374 ms. (3259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 16:32:26] [INFO ] Invariant cache hit.
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:32:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:26] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:26] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:26] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:32:26] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:26] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:26] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:27] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:27] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:27] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:27] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:27] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:27] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-05-25 16:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2024-05-25 16:32:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:27] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:27] [INFO ] Invariant cache hit.
[2024-05-25 16:32:27] [INFO ] Implicit Places using invariants in 31 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37 ms. Remains : 15/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :[106, 2, 1, 110, 2, 103, 1, 3, 3, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:32:27] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000009 steps (2 resets) in 254 ms. (3921 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 3101 ms. (3546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 16:32:31] [INFO ] Invariant cache hit.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:31] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 15 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:31] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:31] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:31] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:31] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:31] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[293, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:32] [INFO ] Invariant cache hit.
[2024-05-25 16:32:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 16:32:32] [INFO ] Invariant cache hit.
[2024-05-25 16:32:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 16:32:32] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:32] [INFO ] Invariant cache hit.
[2024-05-25 16:32:32] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 15/15 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :[113, 2, 1, 104, 2, 103, 1, 3, 3, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 16:32:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000064 steps (2 resets) in 251 ms. (3968 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 3098 ms. (3549 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 16:32:35] [INFO ] Invariant cache hit.
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:35] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:35] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:35] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:35] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 15 ms.
[2024-05-25 16:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:36] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:36] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:36] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:36] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:36] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:36] [INFO ] Invariant cache hit.
[2024-05-25 16:32:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 16:32:36] [INFO ] Invariant cache hit.
[2024-05-25 16:32:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-25 16:32:36] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:36] [INFO ] Invariant cache hit.
[2024-05-25 16:32:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 15/15 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :[108, 2, 1, 101, 2, 102, 1, 3, 3, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40164 steps (8 resets) in 426 ms. (94 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 428 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 243529 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 14
Probabilistic random walk after 243529 steps, saw 156904 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-25 16:32:40] [INFO ] Invariant cache hit.
[2024-05-25 16:32:40] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-25 16:32:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX3 is UNSAT
Problem MAX5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 3 solved, 11 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 9/31 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/32 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 3 solved, 11 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 305ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 3031 ms.
Support contains 10 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:43] [INFO ] Invariant cache hit.
[2024-05-25 16:32:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40247 steps (8 resets) in 44 ms. (894 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 21 ms. (1818 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 260087 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 10
Probabilistic random walk after 260087 steps, saw 167581 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-25 16:32:47] [INFO ] Invariant cache hit.
[2024-05-25 16:32:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 16:32:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 10 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1750 ms.
Support contains 10 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 16:32:49] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:49] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-25 16:32:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:49] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-25 16:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:49] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-25 16:32:49] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-25 16:32:49] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 144 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[297, 2, 1, 287, 2, 299, 1, 3, 3, 1, 2] Max Struct:[303, +inf, +inf, 303, +inf, 303, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10044 steps (2 resets) in 3 ms. (2511 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[103] Max Struct:[303]
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:49] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:49] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[103] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
[2024-05-25 16:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:32:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[303]
RANDOM walk for 1000045 steps (2 resets) in 233 ms. (4273 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 267 ms. (3731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[303]
[2024-05-25 16:32:50] [INFO ] Invariant cache hit.
[2024-05-25 16:32:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:50] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:50] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:50] [INFO ] Invariant cache hit.
[2024-05-25 16:32:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 16:32:50] [INFO ] Invariant cache hit.
[2024-05-25 16:32:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 16:32:50] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:50] [INFO ] Invariant cache hit.
[2024-05-25 16:32:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:32:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297] Max Struct:[303]
RANDOM walk for 1000094 steps (2 resets) in 229 ms. (4348 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 279 ms. (3571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297] Max Struct:[303]
[2024-05-25 16:32:51] [INFO ] Invariant cache hit.
[2024-05-25 16:32:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:51] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:51] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:51] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:51] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:51] [INFO ] Invariant cache hit.
[2024-05-25 16:32:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 16:32:51] [INFO ] Invariant cache hit.
[2024-05-25 16:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 16:32:51] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:51] [INFO ] Invariant cache hit.
[2024-05-25 16:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40108 steps (8 resets) in 33 ms. (1179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 720811 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 720811 steps, saw 464127 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-05-25 16:32:54] [INFO ] Invariant cache hit.
[2024-05-25 16:32:54] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:32:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 546 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=546 )
Parikh walk visited 1 properties in 5 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[297] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-00 in 5213 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 16:32:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10062 steps (2 resets) in 3 ms. (2515 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:32:54] [INFO ] Invariant cache hit.
[2024-05-25 16:32:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:54] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:32:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:54] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:54] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 5 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:32:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 260 ms. (3831 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 237 ms. (4201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
[2024-05-25 16:32:55] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:32:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:55] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:32:55] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
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.
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
[2024-05-25 16:32:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
[2024-05-25 16:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:32:55] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-25 16:32:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
[2024-05-25 16:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-01 in 934 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:32:55] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10088 steps (2 resets) in 4 ms. (2017 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
[2024-05-25 16:32:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:55] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:32:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:32:55] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:55] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:32:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:32:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 223 ms. (4464 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 378 ms. (2638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:32:56] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:32:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:32:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:56] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:56] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
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.
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:32:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-25 16:32:56] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-02 in 1002 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:32:56] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10028 steps (2 resets) in 4 ms. (2005 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[107] Max Struct:[303]
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:32:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:56] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:56] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:56] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[107] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[274] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:56] [INFO ] Invariant cache hit.
[2024-05-25 16:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:32:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[274] Max Struct:[303]
RANDOM walk for 1000037 steps (2 resets) in 236 ms. (4219 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 285 ms. (3496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[274] Max Struct:[303]
[2024-05-25 16:32:57] [INFO ] Invariant cache hit.
[2024-05-25 16:32:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:32:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:57] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:57] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-25 16:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2024-05-25 16:32:57] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:32:57] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[274] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:57] [INFO ] Invariant cache hit.
[2024-05-25 16:32:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 16:32:57] [INFO ] Invariant cache hit.
[2024-05-25 16:32:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-25 16:32:57] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:57] [INFO ] Invariant cache hit.
[2024-05-25 16:32:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[293] Max Struct:[303]
RANDOM walk for 1000021 steps (2 resets) in 227 ms. (4386 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 267 ms. (3731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[293] Max Struct:[303]
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
[2024-05-25 16:32:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:32:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:32:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:32:58] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:32:58] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[293] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
[2024-05-25 16:32:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
[2024-05-25 16:32:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:32:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 16:32:58] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:32:58] [INFO ] Invariant cache hit.
[2024-05-25 16:32:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40225 steps (8 resets) in 30 ms. (1297 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 661560 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 2
Probabilistic random walk after 661560 steps, saw 427023 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
[2024-05-25 16:33:01] [INFO ] Invariant cache hit.
[2024-05-25 16:33:01] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:33:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:02] [INFO ] Invariant cache hit.
[2024-05-25 16:33:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40258 steps (8 resets) in 58 ms. (682 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2573641 steps, run timeout after 3001 ms. (steps per millisecond=857 ) properties seen :0 out of 1
Probabilistic random walk after 2573641 steps, saw 1653004 distinct states, run finished after 3002 ms. (steps per millisecond=857 ) properties seen :0
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:33:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
[2024-05-25 16:33:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:05] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 16:33:05] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 36 edges and 15 vertex of which 6 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 6 /15 variables (removed 9) and now considering 9/21 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2024-05-25 16:33:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 16:33:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:05] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:33:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:05] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 16:33:05] [INFO ] After 1ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:33:05] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:33:05] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 57 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[293] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-03 in 8996 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:05] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10075 steps (2 resets) in 4 ms. (2015 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
[2024-05-25 16:33:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:33:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:05] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:05] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:05] [INFO ] Computed 0 invariants in 2 ms
[2024-05-25 16:33:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 273 ms. (3649 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 176 ms. (5649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:06] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:06] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:33:06] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 16:33:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 22 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-06 in 840 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:06] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10008 steps (2 resets) in 3 ms. (2502 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[107] Max Struct:[303]
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:06] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[107] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
[2024-05-25 16:33:06] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:33:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[303]
RANDOM walk for 1000074 steps (2 resets) in 260 ms. (3831 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 265 ms. (3759 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[303]
[2024-05-25 16:33:07] [INFO ] Invariant cache hit.
[2024-05-25 16:33:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:33:07] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:33:07] [INFO ] Invariant cache hit.
[2024-05-25 16:33:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 16:33:07] [INFO ] Invariant cache hit.
[2024-05-25 16:33:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 16:33:07] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:07] [INFO ] Invariant cache hit.
[2024-05-25 16:33:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 15/15 places, 21/21 transitions.
[2024-05-25 16:33:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299] Max Struct:[303]
RANDOM walk for 1000090 steps (2 resets) in 225 ms. (4425 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 259 ms. (3846 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[303]
[2024-05-25 16:33:08] [INFO ] Invariant cache hit.
[2024-05-25 16:33:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2024-05-25 16:33:08] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:08] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:33:08] [INFO ] Invariant cache hit.
[2024-05-25 16:33:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 16:33:08] [INFO ] Invariant cache hit.
[2024-05-25 16:33:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 16:33:08] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:08] [INFO ] Invariant cache hit.
[2024-05-25 16:33:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40201 steps (8 resets) in 30 ms. (1296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 807260 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 2
Probabilistic random walk after 807260 steps, saw 518814 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-25 16:33:11] [INFO ] Invariant cache hit.
[2024-05-25 16:33:11] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:33:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:11] [INFO ] Invariant cache hit.
[2024-05-25 16:33:11] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40230 steps (8 resets) in 27 ms. (1436 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2670719 steps, run timeout after 3001 ms. (steps per millisecond=889 ) properties seen :0 out of 1
Probabilistic random walk after 2670719 steps, saw 1714713 distinct states, run finished after 3001 ms. (steps per millisecond=889 ) properties seen :0
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:33:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 16:33:15] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 36 edges and 15 vertex of which 6 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 6 /15 variables (removed 9) and now considering 9/21 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2024-05-25 16:33:15] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 16:33:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:15] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:33:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:15] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 16:33:15] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:33:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:33:15] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 54 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-08 in 8947 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:15] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10076 steps (2 resets) in 3 ms. (2519 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
[2024-05-25 16:33:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:15] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:33:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 252 ms. (3952 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 212 ms. (4694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
[2024-05-25 16:33:16] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:16] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:16] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:16] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
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.
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
[2024-05-25 16:33:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
[2024-05-25 16:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 16:33:16] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
[2024-05-25 16:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-09 in 862 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:16] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10028 steps (2 resets) in 4 ms. (2005 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
[2024-05-25 16:33:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:16] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 248 ms. (4016 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 180 ms. (5524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:17] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:17] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:17] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
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.
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-25 16:33:17] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-10 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-10 in 807 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:17] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10087 steps (2 resets) in 4 ms. (2017 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:33:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:17] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 227 ms. (4385 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 181 ms. (5494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:17] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:17] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:17] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
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.
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 16:33:17] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:17] [INFO ] Invariant cache hit.
[2024-05-25 16:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-11 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-11 in 797 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:18] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10051 steps (2 resets) in 4 ms. (2010 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:18] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 225 ms. (4424 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 181 ms. (5494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:18] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:18] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:33:18] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
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.
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 16:33:18] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-12 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-12 in 823 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2024-05-25 16:33:18] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 3 ms. (2500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:18] [INFO ] Invariant cache hit.
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 16:33:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:18] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:18] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) 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 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:33:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 221 ms. (4504 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
[2024-05-25 16:33:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:19] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:19] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:33:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:33:19] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:33:19] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
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.
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
[2024-05-25 16:33:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
[2024-05-25 16:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:33:19] [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.
[2024-05-25 16:33:19] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:33:19] [INFO ] Invariant cache hit.
[2024-05-25 16:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-14 in 822 ms.
[2024-05-25 16:33:19] [INFO ] Flatten gal took : 26 ms
[2024-05-25 16:33:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-25 16:33:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 21 transitions and 69 arcs took 4 ms.
Total runtime 66580 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Murphy-PT-D2N100

IS_COLORED=
IS_NUPN=

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

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

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

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

Process ID: 1756
MODEL NAME: /home/mcc/execution/414/model
15 places, 21 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716655135307

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Murphy-PT-D2N100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349600309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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