MCC'2024- Execution of r508-tall-171654351400333

About the Execution of LTSMin+red for Murphy-PT-D4N050

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
743.968	40385.00	63446.00	140.30	2 251 251 251 251 3 1 3 251 3 251 2 2 ? 251 251	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654351400333.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-D4N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351400333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.2K Apr 11 22:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 11 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 22:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:56 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 19K 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-D4N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D4N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717236157163

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-D4N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 10:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:02:38] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-06-01 10:02:38] [INFO ] Transformed 30 places.
[2024-06-01 10:02:38] [INFO ] Transformed 35 transitions.
[2024-06-01 10:02:38] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 1, 1, 1, 3, 0, 3, 1, 3, 1, 0, 0, 50, 1, 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, 1, 1, 1, 1, 3, 0, 3, 1, 3, 1, 0, 0, 50, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 30 cols
[2024-06-01 10:02:38] [INFO ] Computed 6 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1, 1, 1, 3, 0, 3, 1, 3, 1, 0, 0, 50, 1, 1] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 160014 steps (32 resets) in 128 ms. (1240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 83, 82, 82, 95, 3, 1, 3, 79, 3, 96, 2, 2, 93, 96, 95] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
[2024-06-01 10:02:38] [INFO ] Invariant cache hit.
[2024-06-01 10:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:02:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 10:02:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:02:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:38] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 10:02:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:02:39] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:39] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:02:39] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 67 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:39] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 70 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:39] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 96 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:39] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:02:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:39] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:40] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 84 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 46 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:40] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 51 ms.
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:40] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 83, 82, 82, 95, 3, 1, 3, 79, 3, 96, 2, 2, 93, 96, 95] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 249, 251, 251, 251, 3, 1, 3, 251, 3, 251, 2, 2, 227, 251, 251] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
Support contains 16 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:41] [INFO ] Invariant cache hit.
[2024-06-01 10:02:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :[2, 78, 74, 74, 105, 3, 1, 3, 113, 3, 60, 2, 2, 59, 60, 105]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 249, 251, 251, 251, 3, 1, 3, 251, 3, 251, 2, 2, 227, 251, 251] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
[2024-06-01 10:02:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 249, 251, 251, 251, 3, 1, 3, 251, 3, 251, 2, 2, 227, 251, 251] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
RANDOM walk for 1000041 steps (2 resets) in 535 ms. (1865 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 6856 ms. (2333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 249, 251, 251, 251, 3, 1, 3, 251, 3, 251, 2, 2, 227, 251, 251] Max Struct:[+inf, 255, 255, 255, 255, +inf, +inf, +inf, 255, +inf, 255, +inf, +inf, 255, 255, 255]
[2024-06-01 10:02:49] [INFO ] Invariant cache hit.
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:49] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:02:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:49] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:50] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:50] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:50] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 36 ms returned unsat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:02:50] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:50] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:50] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:02:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:50] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 56 ms.
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2024-06-01 10:02:51] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 249, 251, 251, 251, 3, 1, 3, 251, 3, 251, 2, 2, 227, 251, 251] Max Struct:[+inf, 255, 251, 251, 251, +inf, +inf, +inf, 251, +inf, 251, +inf, +inf, 255, 251, 251]
FORMULA Murphy-PT-D4N050-UpperBounds-15 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-14 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-10 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-08 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-04 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-03 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D4N050-UpperBounds-02 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 251, 3, 1, 3, 3, 2, 2, 227] Max Struct:[+inf, 255, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :[2, 74, 3, 1, 3, 3, 2, 2, 53]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 251, 3, 1, 3, 3, 2, 2, 227] Max Struct:[+inf, 255, +inf, +inf, +inf, +inf, +inf, +inf, 255]
[2024-06-01 10:02:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 251, 3, 1, 3, 3, 2, 2, 227] Max Struct:[+inf, 255, +inf, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 1000056 steps (2 resets) in 468 ms. (2132 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 3926 ms. (2291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 251, 3, 1, 3, 3, 2, 2, 227] Max Struct:[+inf, 255, +inf, +inf, +inf, +inf, +inf, +inf, 255]
[2024-06-01 10:02:55] [INFO ] Invariant cache hit.
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:02:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:02:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:02:55] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:55] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:55] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:56] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:56] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:56] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:56] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-06-01 10:02:56] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:56] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 251, 3, 1, 3, 3, 2, 2, 227] Max Struct:[+inf, 251, +inf, +inf, +inf, +inf, +inf, +inf, 255]
FORMULA Murphy-PT-D4N050-UpperBounds-01 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :[2, 3, 1, 3, 3, 2, 2, 69]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
[2024-06-01 10:02:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 1000016 steps (2 resets) in 464 ms. (2150 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 3502 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
[2024-06-01 10:03:00] [INFO ] Invariant cache hit.
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:03:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:03:00] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:00] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:00] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:00] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:03:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:01] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:03:01] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:01] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:01] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:01] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:03:01] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:03:01] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:03:01] [INFO ] Invariant cache hit.
[2024-06-01 10:03:01] [INFO ] Implicit Places using invariants in 44 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 53 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58 ms. Remains : 25/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=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 8) seen :[2, 3, 1, 3, 3, 2, 2, 53]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
// Phase 1: matrix 35 rows 25 cols
[2024-06-01 10:03:01] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 1000008 steps (2 resets) in 431 ms. (2314 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 3052 ms. (2620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
[2024-06-01 10:03:04] [INFO ] Invariant cache hit.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:03:05] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:03:05] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:03:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:05] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:03:05] [INFO ] Invariant cache hit.
[2024-06-01 10:03:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:03:05] [INFO ] Invariant cache hit.
[2024-06-01 10:03:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 10:03:05] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:03:05] [INFO ] Invariant cache hit.
[2024-06-01 10:03:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=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 8) seen :[2, 3, 1, 3, 3, 2, 2, 51]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 3, 3, 2, 2, 239] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 255]
RANDOM walk for 40059 steps (8 resets) in 454 ms. (88 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 503675 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 9
Probabilistic random walk after 503675 steps, saw 348707 distinct states, run finished after 3007 ms. (steps per millisecond=167 ) properties seen :0
[2024-06-01 10:03:09] [INFO ] Invariant cache hit.
[2024-06-01 10:03:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:03:09] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 7 ms to minimize.
Problem MAX7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 27/44 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 6/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/46 variables, 2/27 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/50 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 2/31 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 10/60 variables, 6/37 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 8 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/17 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 27/44 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 6/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/46 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 4/34 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/50 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/50 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/50 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 10/60 variables, 6/44 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/60 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/60 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/60 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 45 constraints, problems are : Problem set: 1 solved, 8 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 343ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1288 ms.
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 9 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 12
Applied a total of 4 rules in 8 ms. Remains 9 /25 variables (removed 16) and now considering 12/35 (removed 23) transitions.
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 10:03:11] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:03:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 73 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 9/25 places, 12/35 transitions.
RANDOM walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 7/7 properties
Probably explored full state space saw : 216 states, properties seen :0
Probabilistic random walk after 1080 steps, saw 216 distinct states, run finished after 8 ms. (steps per millisecond=135 ) properties seen :0
Explored full state space saw : 216 states, properties seen :0
Exhaustive walk after 1080 steps, saw 216 distinct states, run finished after 4 ms. (steps per millisecond=270 ) properties seen :0
FORMULA Murphy-PT-D4N050-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-11 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-09 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-07 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-06 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-05 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D4N050-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[239] Max Struct:[255]
Starting property specific reduction for Murphy-PT-D4N050-UpperBounds-13
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:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
// Phase 1: matrix 35 rows 25 cols
[2024-06-01 10:03:11] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10021 steps (2 resets) in 5 ms. (1670 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[89] Max Struct:[255]
[2024-06-01 10:03:11] [INFO ] Invariant cache hit.
[2024-06-01 10:03:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:11] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 10:03:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:03:12] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:12] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[89] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[233] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:03:12] [INFO ] Invariant cache hit.
[2024-06-01 10:03:12] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 25/25 places, 35/35 transitions.
[2024-06-01 10:03:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[233] Max Struct:[255]
RANDOM walk for 1000008 steps (2 resets) in 418 ms. (2386 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 378 ms. (2638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[233] Max Struct:[255]
[2024-06-01 10:03:13] [INFO ] Invariant cache hit.
[2024-06-01 10:03:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:03:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:03:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:03:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:03:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:03:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:03:13] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[233] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[233] Max Struct:[255]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:03:13] [INFO ] Invariant cache hit.
[2024-06-01 10:03:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 10:03:13] [INFO ] Invariant cache hit.
[2024-06-01 10:03:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:03:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 10:03:13] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:03:13] [INFO ] Invariant cache hit.
[2024-06-01 10:03:13] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40051 steps (8 resets) in 39 ms. (1001 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 612977 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 2
Probabilistic random walk after 612977 steps, saw 423577 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-06-01 10:03:16] [INFO ] Invariant cache hit.
[2024-06-01 10:03:16] [INFO ] State equation strengthened by 10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:03:17] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 127ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 929 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=464 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[233] Max Struct:[255]
Ending property specific reduction for Murphy-PT-D4N050-UpperBounds-13 in 5181 ms.
[2024-06-01 10:03:17] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:03:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 10:03:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 35 transitions and 115 arcs took 3 ms.
Total runtime 38967 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-D4N050-UpperBounds-13

BK_STOP 1717236197548

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Murphy-PT-D4N050-UpperBounds-13
ub formula formula --maxsum=/tmp/1016/ub_0_
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-D4N050"
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-D4N050, 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-171654351400333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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