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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.9K Apr 11 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 23:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 11 23:12 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 15K 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-D3N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717236027059

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:00:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 10:00:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:00:28] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-06-01 10:00:28] [INFO ] Transformed 24 places.
[2024-06-01 10:00:28] [INFO ] Transformed 28 transitions.
[2024-06-01 10:00:28] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 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:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 28 rows 24 cols
[2024-06-01 10:00:28] [INFO ] Computed 5 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 160014 steps (32 resets) in 137 ms. (1159 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 101, 101, 101, 1, 91, 3, 101, 3, 103, 101, 1, 83] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-06-01 10:00:28] [INFO ] Invariant cache hit.
[2024-06-01 10:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:00:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 10:00:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 10:00:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 10:00:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:28] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 10:00:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:00:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:00:28] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 6 ms to minimize.
[2024-06-01 10:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-01 10:00:28] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:00:28] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:00:29] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:29] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:29] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:29] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:30] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:00:30] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:30] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 10:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:30] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:30] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 10:00:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-06-01 10:00:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:30] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 101, 101, 101, 1, 91, 3, 101, 3, 103, 101, 1, 83] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 189, 201, 201, 1, 197, 3, 126, 3, 197, 197, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:00:31] [INFO ] Invariant cache hit.
[2024-06-01 10:00:31] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 485ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :[2, 3, 3, 2, 51, 82, 82, 1, 107, 3, 62, 3, 58, 82, 1, 73]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 189, 201, 201, 1, 197, 3, 126, 3, 197, 197, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-06-01 10:00:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 189, 201, 201, 1, 197, 3, 126, 3, 197, 197, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 1000000 steps (2 resets) in 499 ms. (2000 steps per ms)
BEST_FIRST walk for 16000013 steps (32 resets) in 6232 ms. (2566 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 189, 201, 201, 1, 201, 3, 126, 3, 197, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-06-01 10:00:38] [INFO ] Invariant cache hit.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:00:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:00:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 10:00:38] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 10:00:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:00:38] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:38] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:38] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:38] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:38] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:38] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:00:39] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:39] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:39] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:39] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:39] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:39] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 189, 201, 201, 1, 201, 3, 126, 3, 197, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 201, 201, +inf, 201, +inf, 204, +inf, 204, 201, +inf, 201]
FORMULA Murphy-PT-D3N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 174, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :[2, 3, 3, 2, 57, 1, 3, 51, 3, 57, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 174, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-06-01 10:00:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 174, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000032 steps (2 resets) in 418 ms. (2386 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 4204 ms. (2615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 174, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-06-01 10:00:44] [INFO ] Invariant cache hit.
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:00:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
[2024-06-01 10:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 10:00:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:00:44] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:44] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:44] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:44] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:45] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:45] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:45] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:45] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:00:45] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 10:00:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:45] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:45] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 174, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:00:45] [INFO ] Invariant cache hit.
[2024-06-01 10:00:45] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40 ms. Remains : 20/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=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 :[2, 3, 3, 2, 53, 1, 3, 59, 3, 52, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
// Phase 1: matrix 28 rows 20 cols
[2024-06-01 10:00:45] [INFO ] Computed 1 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000013 steps (2 resets) in 391 ms. (2551 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 3846 ms. (2859 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-06-01 10:00:49] [INFO ] Invariant cache hit.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 10:00:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:50] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:50] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:00:50] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:00:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:00:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:00:50] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:00:51] [INFO ] Invariant cache hit.
[2024-06-01 10:00:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 10:00:51] [INFO ] Invariant cache hit.
[2024-06-01 10:00:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:00:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 10:00:51] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:00:51] [INFO ] Invariant cache hit.
[2024-06-01 10:00:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=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 :[2, 3, 3, 2, 62, 1, 3, 55, 3, 51, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 40129 steps (8 resets) in 721 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 209304 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 14
Probabilistic random walk after 209304 steps, saw 141670 distinct states, run finished after 3004 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 10:00:55] [INFO ] Invariant cache hit.
[2024-06-01 10:00:55] [INFO ] State equation strengthened by 8 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) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 10:00:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem MAX4 is UNSAT
Problem MAX7 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 3 solved, 11 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 5/16 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 5/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/33 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 3 solved, 11 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 340ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 5266 ms.
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:00] [INFO ] Invariant cache hit.
[2024-06-01 10:01:00] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40111 steps (8 resets) in 81 ms. (489 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 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 35 ms. (1111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 254376 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 10
Probabilistic random walk after 254376 steps, saw 171996 distinct states, run finished after 3003 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 10:01:04] [INFO ] Invariant cache hit.
[2024-06-01 10:01:04] [INFO ] State equation strengthened by 8 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) 6/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 10:01:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 6/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2594 ms.
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:07] [INFO ] Invariant cache hit.
[2024-06-01 10:01:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 10:01:07] [INFO ] Invariant cache hit.
[2024-06-01 10:01:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 10:01:07] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:07] [INFO ] Invariant cache hit.
[2024-06-01 10:01:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-06-01 10:01:07] [INFO ] Invariant cache hit.
[2024-06-01 10:01:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:07] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 10:01:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:07] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-01 10:01:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:07] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 10:01:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-06-01 10:01:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:01:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:01:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:01:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 59 ms
TRAPS : Iteration 1
[2024-06-01 10:01:07] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 10:01:08] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 308 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 179, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-00
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-06-01 10:01:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 4 ms. (2000 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:[2] Max Struct:[+inf]
[2024-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:08] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:01:08] [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 36 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 72 ms. Remains : 3/20 places, 4/28 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-06-01 10:01:08] [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 228 ms. (4366 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 227 ms. (4385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:08] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:08] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:08] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 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-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 10:01:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [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 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 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 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]
RANDOM walk for 40003 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 24 ms. (1600 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 6 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 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-00 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-D3N050-UpperBounds-00 in 916 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-01
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 28 rows 20 cols
[2024-06-01 10:01:08] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10009 steps (2 resets) in 5 ms. (1668 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:[3] Max Struct:[+inf]
[2024-06-01 10:01:08] [INFO ] Invariant cache hit.
[2024-06-01 10:01:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:01:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:09] [INFO ] Added : 3 causal constraints over 1 iterations in 8 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:09] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:01:09] [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 30 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 66ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 3/20 places, 4/28 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:01:09] [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 219 ms. (4545 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 178 ms. (5586 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:01:09] [INFO ] Invariant cache hit.
[2024-06-01 10:01:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:01:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:09] [INFO ] Added : 3 causal constraints over 1 iterations in 4 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 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-06-01 10:01:09] [INFO ] Invariant cache hit.
[2024-06-01 10:01:09] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 10:01:09] [INFO ] Invariant cache hit.
[2024-06-01 10:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 10:01:09] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:09] [INFO ] Invariant cache hit.
[2024-06-01 10:01:09] [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 42 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 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 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-01 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-D3N050-UpperBounds-01 in 822 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
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 28 rows 20 cols
[2024-06-01 10:01:09] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10031 steps (2 resets) in 5 ms. (1671 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:[3] Max Struct:[+inf]
[2024-06-01 10:01:09] [INFO ] Invariant cache hit.
[2024-06-01 10:01:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:01:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:09] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:09] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:01:09] [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 28 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 68 ms. Remains : 3/20 places, 4/28 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 :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:01:09] [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 231 ms. (4310 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-06-01 10:01:10] [INFO ] Invariant cache hit.
[2024-06-01 10:01:10] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:01:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:10] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:01:10] [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 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-06-01 10:01:10] [INFO ] Invariant cache hit.
[2024-06-01 10:01:10] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:01:10] [INFO ] Invariant cache hit.
[2024-06-01 10:01:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:10] [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-06-01 10:01:10] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:10] [INFO ] Invariant cache hit.
[2024-06-01 10:01:10] [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 74ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 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 :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 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-D3N050-UpperBounds-02 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-D3N050-UpperBounds-02 in 813 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
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 28 rows 20 cols
[2024-06-01 10:01:10] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10025 steps (2 resets) in 4 ms. (2005 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:[2] Max Struct:[+inf]
[2024-06-01 10:01:10] [INFO ] Invariant cache hit.
[2024-06-01 10:01:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:10] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:10] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 0 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:10] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:01:10] [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 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 3/20 places, 4/28 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-06-01 10:01:10] [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 222 ms. (4484 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 170 ms. (5847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:11] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:01:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:11] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:01:11] [INFO ] Added : 2 causal constraints over 1 iterations in 3 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 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-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-06-01 10:01:11] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [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 29 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 99 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 9 ms. (steps per millisecond=1111 ) 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 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 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-D3N050-UpperBounds-03 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-D3N050-UpperBounds-03 in 790 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-06-01 10:01:11] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10014 steps (2 resets) in 5 ms. (1669 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:[94] Max Struct:[204]
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:11] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:11] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[94] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[185] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
[2024-06-01 10:01:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 20/20 places, 28/28 transitions.
[2024-06-01 10:01:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[185] Max Struct:[204]
RANDOM walk for 1000018 steps (2 resets) in 341 ms. (2924 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 336 ms. (2967 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[185] Max Struct:[204]
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
[2024-06-01 10:01:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 10:01:12] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:12] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[185] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
[2024-06-01 10:01:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
[2024-06-01 10:01:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:12] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 10:01:12] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
[2024-06-01 10:01:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 20/20 places, 28/28 transitions.
[2024-06-01 10:01:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000035 steps (2 resets) in 363 ms. (2747 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 347 ms. (2873 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2024-06-01 10:01:13] [INFO ] Invariant cache hit.
[2024-06-01 10:01:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 10:01:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:13] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:13] [INFO ] Invariant cache hit.
[2024-06-01 10:01:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 10:01:13] [INFO ] Invariant cache hit.
[2024-06-01 10:01:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 10:01:13] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:13] [INFO ] Invariant cache hit.
[2024-06-01 10:01:13] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40060 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 705393 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 705393 steps, saw 478744 distinct states, run finished after 3003 ms. (steps per millisecond=234 ) properties seen :0
[2024-06-01 10:01:17] [INFO ] Invariant cache hit.
[2024-06-01 10:01:17] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:01:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 115ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:17] [INFO ] Invariant cache hit.
[2024-06-01 10:01:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40042 steps (8 resets) in 23 ms. (1668 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2503642 steps, run timeout after 3001 ms. (steps per millisecond=834 ) properties seen :0 out of 1
Probabilistic random walk after 2503642 steps, saw 1704215 distinct states, run finished after 3002 ms. (steps per millisecond=833 ) properties seen :0
[2024-06-01 10:01:20] [INFO ] Invariant cache hit.
[2024-06-01 10:01:20] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:21] [INFO ] Invariant cache hit.
[2024-06-01 10:01:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 10:01:21] [INFO ] Invariant cache hit.
[2024-06-01 10:01:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 10:01:21] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:21] [INFO ] Invariant cache hit.
[2024-06-01 10:01:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 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
Applied a total of 1 rules in 2 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 10:01:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:01:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:21] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:01:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:21] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:01:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 10:01:21] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:01:21] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:01:21] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 58 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-04 in 10104 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
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 28 rows 20 cols
[2024-06-01 10:01:21] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10016 steps (2 resets) in 6 ms. (1430 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-06-01 10:01:21] [INFO ] Invariant cache hit.
[2024-06-01 10:01:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:21] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:01:21] [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 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 66 ms. Remains : 3/20 places, 4/28 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]
[2024-06-01 10:01:21] [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 247 ms. (4032 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 220 ms. (4524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:22] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:01:22] [INFO ] Added : 3 causal constraints over 2 iterations in 5 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 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-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-06-01 10:01:22] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [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 32 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 72ms 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 112 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 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]
RANDOM walk for 40001 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 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 8 ms. (steps per millisecond=1 ) 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-D3N050-UpperBounds-07 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-D3N050-UpperBounds-07 in 871 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-09
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 28 rows 20 cols
[2024-06-01 10:01:22] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10031 steps (2 resets) in 5 ms. (1671 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:[3] Max Struct:[+inf]
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:22] [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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:22] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:01:22] [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 28 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 68 ms. Remains : 3/20 places, 4/28 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]
[2024-06-01 10:01:22] [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 220 ms. (4524 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 169 ms. (5882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:22] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:22] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:22] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:01:22] [INFO ] Added : 3 causal constraints over 1 iterations in 19 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 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-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:22] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:01:22] [INFO ] Invariant cache hit.
[2024-06-01 10:01:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:23] [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-06-01 10:01:23] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:23] [INFO ] Invariant cache hit.
[2024-06-01 10:01:23] [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 27 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 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 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 25 ms. (1538 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 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 7 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 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-09 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-D3N050-UpperBounds-09 in 816 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-06-01 10:01:23] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10033 steps (2 resets) in 4 ms. (2006 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:[99] Max Struct:[204]
[2024-06-01 10:01:23] [INFO ] Invariant cache hit.
[2024-06-01 10:01:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:23] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:23] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[99] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:23] [INFO ] Invariant cache hit.
[2024-06-01 10:01:23] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 20/20 places, 28/28 transitions.
[2024-06-01 10:01:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000053 steps (2 resets) in 374 ms. (2666 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 342 ms. (2915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2024-06-01 10:01:24] [INFO ] Invariant cache hit.
[2024-06-01 10:01:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:24] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:24] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:24] [INFO ] Invariant cache hit.
[2024-06-01 10:01:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 10:01:24] [INFO ] Invariant cache hit.
[2024-06-01 10:01:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 10:01:24] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:24] [INFO ] Invariant cache hit.
[2024-06-01 10:01:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40088 steps (8 resets) in 43 ms. (911 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 568603 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 2
Probabilistic random walk after 568603 steps, saw 387057 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-06-01 10:01:27] [INFO ] Invariant cache hit.
[2024-06-01 10:01:27] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:01:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:27] [INFO ] Invariant cache hit.
[2024-06-01 10:01:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40085 steps (8 resets) in 34 ms. (1145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2547468 steps, run timeout after 3001 ms. (steps per millisecond=848 ) properties seen :0 out of 1
Probabilistic random walk after 2547468 steps, saw 1734007 distinct states, run finished after 3001 ms. (steps per millisecond=848 ) properties seen :0
[2024-06-01 10:01:31] [INFO ] Invariant cache hit.
[2024-06-01 10:01:31] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:31] [INFO ] Invariant cache hit.
[2024-06-01 10:01:31] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 10:01:31] [INFO ] Invariant cache hit.
[2024-06-01 10:01:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 10:01:31] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:31] [INFO ] Invariant cache hit.
[2024-06-01 10:01:31] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 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
Applied a total of 1 rules in 1 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 10:01:31] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-06-01 10:01:31] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:31] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:01:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 10:01:31] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:01:31] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:01:31] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 68 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-10 in 8755 ms.
Starting property specific reduction for Murphy-PT-D3N050-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 28 rows 20 cols
[2024-06-01 10:01:31] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 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:[3] Max Struct:[+inf]
[2024-06-01 10:01:31] [INFO ] Invariant cache hit.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:31] [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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:32] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:01:32] [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 26 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 26 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/20 places, 4/28 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]
[2024-06-01 10:01:32] [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 311 ms. (3205 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 173 ms. (5747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 10:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:01:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:32] [INFO ] Added : 3 causal constraints over 1 iterations in 6 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 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-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 10:01:32] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [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 32 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 74ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 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 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 15 ms. (2500 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 40 ms. (steps per millisecond=0 ) 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-D3N050-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-D3N050-UpperBounds-11 in 939 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-06-01 10:01:32] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10027 steps (2 resets) in 8 ms. (1114 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[99] Max Struct:[204]
[2024-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:32] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:32] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[99] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:33] [INFO ] Invariant cache hit.
[2024-06-01 10:01:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 20/20 places, 28/28 transitions.
[2024-06-01 10:01:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[204]
RANDOM walk for 1000000 steps (2 resets) in 388 ms. (2570 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 367 ms. (2717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[204]
[2024-06-01 10:01:34] [INFO ] Invariant cache hit.
[2024-06-01 10:01:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:34] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:34] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 10:01:34] [INFO ] Invariant cache hit.
[2024-06-01 10:01:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:01:34] [INFO ] Invariant cache hit.
[2024-06-01 10:01:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 10:01:34] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:34] [INFO ] Invariant cache hit.
[2024-06-01 10:01:34] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40046 steps (8 resets) in 50 ms. (785 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 609320 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 609320 steps, saw 413084 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2024-06-01 10:01:37] [INFO ] Invariant cache hit.
[2024-06-01 10:01:37] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:01:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-06-01 10:01:37] [INFO ] Invariant cache hit.
[2024-06-01 10:01:37] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40057 steps (8 resets) in 41 ms. (953 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2398670 steps, run timeout after 3001 ms. (steps per millisecond=799 ) properties seen :0 out of 1
Probabilistic random walk after 2398670 steps, saw 1632363 distinct states, run finished after 3001 ms. (steps per millisecond=799 ) properties seen :0
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [INFO ] State equation strengthened by 8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:01:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1740 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=870 )
Parikh walk visited 1 properties in 7 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[197] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-12 in 8329 ms.
Starting property specific reduction for Murphy-PT-D3N050-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]
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (2 resets) in 5 ms. (1667 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-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 10:01:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:41] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:41] [INFO ] Added : 1 causal constraints over 1 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 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 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 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 10:01:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:01:41] [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 26 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 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 65 ms. Remains : 3/20 places, 4/28 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]
[2024-06-01 10:01:41] [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 220 ms. (4524 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 174 ms. (5714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:41] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:01:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:01:41] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:01:41] [INFO ] Added : 3 causal constraints over 2 iterations in 3 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:01:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 10:01:41] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:01:41] [INFO ] Invariant cache hit.
[2024-06-01 10:01:41] [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 32 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 109 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 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]
RANDOM walk for 40001 steps (8 resets) in 83 ms. (476 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 7 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 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-14 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-D3N050-UpperBounds-14 in 793 ms.
[2024-06-01 10:01:42] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:01:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 10:01:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 28 transitions and 92 arcs took 3 ms.
Total runtime 73911 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Murphy-PT-D3N050-UpperBounds-04
Could not compute solution for formula : Murphy-PT-D3N050-UpperBounds-10
Could not compute solution for formula : Murphy-PT-D3N050-UpperBounds-12

BK_STOP 1717236102371

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Murphy-PT-D3N050-UpperBounds-04
ub formula formula --maxsum=/tmp/1606/ub_0_
ub formula name Murphy-PT-D3N050-UpperBounds-10
ub formula formula --maxsum=/tmp/1606/ub_1_
ub formula name Murphy-PT-D3N050-UpperBounds-12
ub formula formula --maxsum=/tmp/1606/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D3N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;