MCC'2024- Execution of r480-tall-171624189900725

About the Execution of LTSMin+red for DES-PT-40b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
644.804	491394.00	586760.00	836.20	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189900725.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 DES-PT-40b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900725
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 115K May 18 16:42 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 DES-PT-40b-UpperBounds-00
FORMULA_NAME DES-PT-40b-UpperBounds-01
FORMULA_NAME DES-PT-40b-UpperBounds-02
FORMULA_NAME DES-PT-40b-UpperBounds-03
FORMULA_NAME DES-PT-40b-UpperBounds-04
FORMULA_NAME DES-PT-40b-UpperBounds-05
FORMULA_NAME DES-PT-40b-UpperBounds-06
FORMULA_NAME DES-PT-40b-UpperBounds-07
FORMULA_NAME DES-PT-40b-UpperBounds-08
FORMULA_NAME DES-PT-40b-UpperBounds-09
FORMULA_NAME DES-PT-40b-UpperBounds-10
FORMULA_NAME DES-PT-40b-UpperBounds-11
FORMULA_NAME DES-PT-40b-UpperBounds-12
FORMULA_NAME DES-PT-40b-UpperBounds-13
FORMULA_NAME DES-PT-40b-UpperBounds-14
FORMULA_NAME DES-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717196485944

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:01:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:01:27] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-31 23:01:27] [INFO ] Transformed 439 places.
[2024-05-31 23:01:27] [INFO ] Transformed 390 transitions.
[2024-05-31 23:01:27] [INFO ] Found NUPN structural information;
[2024-05-31 23:01:27] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 390 rows 439 cols
[2024-05-31 23:01:27] [INFO ] Computed 65 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (85 resets) in 67 ms. (147 steps per ms)
FORMULA DES-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (79 resets) in 104 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:01:27] [INFO ] Invariant cache hit.
[2024-05-31 23:01:28] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2024-05-31 23:01:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-31 23:01:28] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-31 23:01:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2024-05-31 23:01:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:28] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-31 23:01:29] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 17 ms to minimize.
[2024-05-31 23:01:29] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 22 ms to minimize.
[2024-05-31 23:01:29] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 5 ms to minimize.
[2024-05-31 23:01:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:01:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 701 ms
[2024-05-31 23:01:29] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 27 ms.
[2024-05-31 23:01:31] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:01:31] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:01:31] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:01:32] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:01:32] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:01:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 589 ms
[2024-05-31 23:01:32] [INFO ] Added : 229 causal constraints over 46 iterations in 2541 ms. Result :sat
Minimization took 508 ms.
[2024-05-31 23:01:32] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 23:01:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:33] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 23:01:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2024-05-31 23:01:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-31 23:01:33] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 23:01:33] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 33 ms.
[2024-05-31 23:01:35] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:01:35] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:01:36] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 2 ms to minimize.
[2024-05-31 23:01:36] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-31 23:01:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2024-05-31 23:01:36] [INFO ] Added : 251 causal constraints over 52 iterations in 2897 ms. Result :sat
Minimization took 507 ms.
[2024-05-31 23:01:36] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 23:01:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-31 23:01:37] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 23:01:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-31 23:01:37] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-31 23:01:37] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-31 23:01:37] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2024-05-31 23:01:37] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-31 23:01:37] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:01:37] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:01:38] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:01:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 736 ms
[2024-05-31 23:01:38] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 27 ms.
[2024-05-31 23:01:40] [INFO ] Added : 298 causal constraints over 61 iterations in 1931 ms. Result :sat
Minimization took 371 ms.
[2024-05-31 23:01:40] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 23:01:40] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:40] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-05-31 23:01:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:41] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:01:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 977 ms
[2024-05-31 23:01:42] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-31 23:01:44] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-31 23:01:45] [INFO ] Added : 377 causal constraints over 76 iterations in 2725 ms. Result :sat
Minimization took 275 ms.
[2024-05-31 23:01:45] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-05-31 23:01:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-31 23:01:45] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-31 23:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2024-05-31 23:01:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:45] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 4 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 995 ms
[2024-05-31 23:01:46] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-31 23:01:49] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:01:49] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:01:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2024-05-31 23:01:49] [INFO ] Added : 316 causal constraints over 64 iterations in 2530 ms. Result :sat
Minimization took 353 ms.
[2024-05-31 23:01:49] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2024-05-31 23:01:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-31 23:01:50] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 23:01:50] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2024-05-31 23:01:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-31 23:01:50] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-31 23:01:50] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:01:50] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:01:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 684 ms
[2024-05-31 23:01:51] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-31 23:01:53] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:01:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:01:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2024-05-31 23:01:53] [INFO ] Added : 249 causal constraints over 50 iterations in 1946 ms. Result :sat
Minimization took 291 ms.
[2024-05-31 23:01:53] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2024-05-31 23:01:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:53] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 23:01:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:01:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2024-05-31 23:01:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 23:01:54] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-05-31 23:01:54] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-31 23:01:54] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2024-05-31 23:01:54] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-31 23:01:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 473 ms
[2024-05-31 23:01:54] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 11 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2024-05-31 23:01:57] [INFO ] Added : 329 causal constraints over 67 iterations in 2838 ms. Result :sat
Minimization took 464 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 433 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 433 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 412 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 412 transition count 354
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 403 transition count 354
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 384 transition count 335
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 384 transition count 335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 384 transition count 334
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 383 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 368 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 368 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 368 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 366 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 366 transition count 300
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 363 transition count 300
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 286 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 284 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 284 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 282 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 281 transition count 223
Applied a total of 319 rules in 203 ms. Remains 281 /439 variables (removed 158) and now considering 223/390 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 281/439 places, 223/390 transitions.
// Phase 1: matrix 223 rows 281 cols
[2024-05-31 23:02:04] [INFO ] Computed 64 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47970 resets) in 2925 ms. (341 steps per ms)
BEST_FIRST walk for 7000007 steps (63952 resets) in 7646 ms. (915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:02:14] [INFO ] Invariant cache hit.
[2024-05-31 23:02:14] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:14] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-31 23:02:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-31 23:02:15] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:02:15] [INFO ] Added : 101 causal constraints over 21 iterations in 338 ms. Result :sat
Minimization took 108 ms.
[2024-05-31 23:02:15] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-31 23:02:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:15] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-31 23:02:16] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 17 ms.
[2024-05-31 23:02:16] [INFO ] Added : 164 causal constraints over 33 iterations in 553 ms. Result :sat
Minimization took 113 ms.
[2024-05-31 23:02:16] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:16] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:16] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-31 23:02:16] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 17 ms.
[2024-05-31 23:02:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:16] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-31 23:02:17] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:02:17] [INFO ] Added : 110 causal constraints over 22 iterations in 368 ms. Result :sat
Minimization took 107 ms.
[2024-05-31 23:02:17] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-31 23:02:17] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-31 23:02:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:02:17] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 23:02:18] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:02:18] [INFO ] Added : 209 causal constraints over 42 iterations in 683 ms. Result :sat
Minimization took 118 ms.
[2024-05-31 23:02:18] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:18] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:02:18] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-31 23:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:02:19] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:02:19] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 23:02:19] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:02:19] [INFO ] Added : 157 causal constraints over 32 iterations in 518 ms. Result :sat
Minimization took 125 ms.
[2024-05-31 23:02:19] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:19] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:02:20] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 23:02:20] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-31 23:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 7 ms returned sat
[2024-05-31 23:02:20] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:20] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:02:20] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-31 23:02:20] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 21 ms.
[2024-05-31 23:02:20] [INFO ] Added : 71 causal constraints over 15 iterations in 247 ms. Result :sat
Minimization took 101 ms.
[2024-05-31 23:02:20] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:20] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:02:20] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-31 23:02:20] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 18 ms.
[2024-05-31 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:02:21] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:02:21] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 23:02:21] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:02:21] [INFO ] Added : 178 causal constraints over 36 iterations in 597 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 11 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 281/281 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:02:24] [INFO ] Invariant cache hit.
[2024-05-31 23:02:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-31 23:02:24] [INFO ] Invariant cache hit.
[2024-05-31 23:02:25] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-31 23:02:25] [INFO ] Redundant transitions in 7 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 4/281 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:28] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:02:30] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:30] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:02:30] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:02:37] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:02:38] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/504 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 353 constraints, problems are : Problem set: 0 solved, 220 unsolved in 19352 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 4/281 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 220/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:09] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 574 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 9/9 constraints]
After SMT, in 49598ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 49611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50164 ms. Remains : 281/281 places, 223/223 transitions.
RANDOM walk for 40000 steps (1947 resets) in 1873 ms. (21 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (369 resets) in 421 ms. (94 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (370 resets) in 202 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (335 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (351 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (373 resets) in 108 ms. (366 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (383 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (365 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (348 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (371 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (376 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (392 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (357 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (390 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (351 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 487825 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :6 out of 14
Probabilistic random walk after 487825 steps, saw 123449 distinct states, run finished after 3004 ms. (steps per millisecond=162 ) properties seen :6
[2024-05-31 23:03:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 160/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 25/262 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 7/269 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 219/488 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 14/502 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/504 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/504 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 346 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1291 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 160/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 25/262 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 7/269 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 219/488 variables, 269/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 14/502 variables, 10/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/502 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/502 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 2/504 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/504 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:21] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/504 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/504 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/504 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 356 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11252 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 11 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 281/281 places, 223/223 transitions.
RANDOM walk for 40000 steps (1883 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (356 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (351 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (333 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (377 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (366 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (339 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (365 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (379 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 548346 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 8
Probabilistic random walk after 548346 steps, saw 138483 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-31 23:03:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 160/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 25/262 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 7/269 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 219/488 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 14/502 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/504 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/504 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 346 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 160/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:38] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 25/262 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 7/269 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 219/488 variables, 269/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 14/502 variables, 10/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/502 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/502 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 2/504 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/504 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:03:39] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/504 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/504 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/504 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 356 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 2816ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10688 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 25 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 281/281 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:03:50] [INFO ] Invariant cache hit.
[2024-05-31 23:03:50] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-31 23:03:50] [INFO ] Invariant cache hit.
[2024-05-31 23:03:50] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-31 23:03:50] [INFO ] Redundant transitions in 7 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 4/281 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:53] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:03:54] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:55] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:03:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:04:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:04:02] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:04:02] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:04:02] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/504 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 353 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18835 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 4/281 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 220/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:04:32] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 574 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 9/9 constraints]
After SMT, in 48992ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 48998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49530 ms. Remains : 281/281 places, 223/223 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-31 23:04:39] [INFO ] Invariant cache hit.
[2024-05-31 23:04:39] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:04:39] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:04:39] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
TRAPS : Iteration 0
[2024-05-31 23:04:40] [INFO ] After 172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
[2024-05-31 23:04:40] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2024-05-31 23:04:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 7 ms returned sat
[2024-05-31 23:04:40] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:04:40] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-31 23:04:40] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-05-31 23:04:40] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-31 23:04:40] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 1154 ms.
FORMULA DES-PT-40b-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40b-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Starting property specific reduction for DES-PT-40b-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:04:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (466 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (101 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:04:40] [INFO ] Invariant cache hit.
[2024-05-31 23:04:40] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:04:40] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:04:41] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-31 23:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:04:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:04:41] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:04:41] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 23:04:41] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:04:41] [INFO ] Added : 164 causal constraints over 33 iterations in 561 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 281 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p93) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 222/222 transitions.
Graph (complete) has 954 edges and 281 vertex of which 276 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 274 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 273 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 272 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6 place count 271 transition count 216
Applied a total of 6 rules in 13 ms. Remains 271 /281 variables (removed 10) and now considering 216/222 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/281 places, 216/222 transitions.
// Phase 1: matrix 216 rows 271 cols
[2024-05-31 23:04:42] [INFO ] Computed 61 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47720 resets) in 2858 ms. (349 steps per ms)
BEST_FIRST walk for 1000000 steps (9149 resets) in 1055 ms. (946 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:04:46] [INFO ] Invariant cache hit.
[2024-05-31 23:04:46] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:04:46] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:04:46] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 23:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:04:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:04:46] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:04:46] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 23:04:46] [INFO ] Computed and/alt/rep : 202/372/202 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-31 23:04:46] [INFO ] Added : 107 causal constraints over 22 iterations in 380 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 23:04:47] [INFO ] Invariant cache hit.
[2024-05-31 23:04:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-31 23:04:47] [INFO ] Invariant cache hit.
[2024-05-31 23:04:47] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-31 23:04:47] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-31 23:04:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/269 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 2/271 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 216/487 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 23:04:54] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:04:54] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 23:04:57] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:04:57] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/487 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 336 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15601 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 2/269 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 2/271 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 216/487 variables, 271/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 213/549 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 23:05:13] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:05:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 551 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 6/6 constraints]
After SMT, in 45728ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 45730ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46238 ms. Remains : 271/271 places, 216/216 transitions.
RANDOM walk for 40000 steps (1934 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (351 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (375 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 608107 steps, run visited all 2 properties in 2290 ms. (steps per millisecond=265 )
Probabilistic random walk after 608107 steps, saw 153681 distinct states, run finished after 2295 ms. (steps per millisecond=264 ) properties seen :2
FORMULA DES-PT-40b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40b-UpperBounds-04 in 55363 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 223 rows 281 cols
[2024-05-31 23:05:36] [INFO ] Computed 64 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (470 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (101 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:05:36] [INFO ] Invariant cache hit.
[2024-05-31 23:05:36] [INFO ] [Real]Absence check using 39 positive place invariants in 7 ms returned sat
[2024-05-31 23:05:36] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:05:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-31 23:05:36] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 19 ms.
[2024-05-31 23:05:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:05:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:05:36] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:05:36] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:05:36] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:05:37] [INFO ] Added : 209 causal constraints over 42 iterations in 635 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 281/281 places, 223/223 transitions.
[2024-05-31 23:05:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47806 resets) in 2868 ms. (348 steps per ms)
BEST_FIRST walk for 1000001 steps (9050 resets) in 1049 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:05:41] [INFO ] Invariant cache hit.
[2024-05-31 23:05:41] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:05:41] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:05:42] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:05:42] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-31 23:05:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:05:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2024-05-31 23:05:42] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:05:42] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 23:05:42] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:05:42] [INFO ] Added : 209 causal constraints over 42 iterations in 658 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 18 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 281/281 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:05:43] [INFO ] Invariant cache hit.
[2024-05-31 23:05:43] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 23:05:43] [INFO ] Invariant cache hit.
[2024-05-31 23:05:44] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-31 23:05:44] [INFO ] Redundant transitions in 2 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 4/281 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:05:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:05:48] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/504 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 353 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18784 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 4/281 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/504 variables, 281/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 220/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:06:25] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 574 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 9/9 constraints]
After SMT, in 48911ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 48913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49438 ms. Remains : 281/281 places, 223/223 transitions.
RANDOM walk for 40000 steps (1918 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (379 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (403 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 678725 steps, run timeout after 3009 ms. (steps per millisecond=225 ) properties seen :0 out of 2
Probabilistic random walk after 678725 steps, saw 171300 distinct states, run finished after 3009 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-31 23:06:36] [INFO ] Invariant cache hit.
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) 163/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/262 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/269 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 219/488 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/502 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/504 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/504 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 163/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/202 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/237 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/262 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/269 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 219/488 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/502 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/504 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/504 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 985 ms.
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 281/281 places, 223/223 transitions.
RANDOM walk for 40000 steps (1935 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (384 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (359 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 740561 steps, run visited all 2 properties in 2570 ms. (steps per millisecond=288 )
Probabilistic random walk after 740561 steps, saw 186859 distinct states, run finished after 2570 ms. (steps per millisecond=288 ) properties seen :2
FORMULA DES-PT-40b-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40b-UpperBounds-08 in 64517 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:06:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (482 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10000 steps (83 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:06:40] [INFO ] Invariant cache hit.
[2024-05-31 23:06:40] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:06:40] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:06:40] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-31 23:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:06:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2024-05-31 23:06:40] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:06:41] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:06:41] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:06:41] [INFO ] Added : 157 causal constraints over 32 iterations in 506 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 281 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p15) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 222/222 transitions.
Graph (complete) has 952 edges and 281 vertex of which 276 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 274 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 273 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 272 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6 place count 271 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7 place count 270 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8 place count 269 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 9 place count 268 transition count 213
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 10 place count 268 transition count 213
Applied a total of 10 rules in 24 ms. Remains 268 /281 variables (removed 13) and now considering 213/222 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 268/281 places, 213/222 transitions.
// Phase 1: matrix 213 rows 268 cols
[2024-05-31 23:06:42] [INFO ] Computed 61 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47887 resets) in 2848 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (9119 resets) in 1062 ms. (940 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:06:46] [INFO ] Invariant cache hit.
[2024-05-31 23:06:46] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:06:46] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:06:46] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-31 23:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:06:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:06:46] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:06:46] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-31 23:06:46] [INFO ] Computed and/alt/rep : 199/353/199 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:06:47] [INFO ] Added : 178 causal constraints over 36 iterations in 648 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 268/268 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:06:47] [INFO ] Invariant cache hit.
[2024-05-31 23:06:47] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 23:06:47] [INFO ] Invariant cache hit.
[2024-05-31 23:06:48] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-31 23:06:48] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/265 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:06:51] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 2/267 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 8 (OVERLAPS) 213/480 variables, 267/329 constraints. Problems are: Problem set: 12 solved, 198 unsolved
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 6/335 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/335 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/481 variables, 1/336 constraints. Problems are: Problem set: 12 solved, 198 unsolved
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 3/339 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 0/339 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 0/481 variables, 0/339 constraints. Problems are: Problem set: 12 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 339 constraints, problems are : Problem set: 12 solved, 198 unsolved in 17661 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 12 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 36/36 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 17/53 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 6/59 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/59 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/253 variables, 1/60 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 2/62 constraints. Problems are: Problem set: 12 solved, 198 unsolved
[2024-05-31 23:07:07] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 1/63 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/63 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 14/267 variables, 7/70 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 2/72 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 213/480 variables, 267/339 constraints. Problems are: Problem set: 12 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 198/537 constraints. Problems are: Problem set: 12 solved, 198 unsolved
[2024-05-31 23:07:23] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:07:27] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 2/539 constraints. Problems are: Problem set: 12 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/481 variables, and 539 constraints, problems are : Problem set: 12 solved, 198 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 267/268 constraints, PredecessorRefiner: 198/210 constraints, Known Traps: 13/13 constraints]
After SMT, in 47772ms problems are : Problem set: 12 solved, 198 unsolved
Search for dead transitions found 12 dead transitions in 47775ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 268/268 places, 201/213 transitions.
Graph (complete) has 864 edges and 268 vertex of which 256 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 256 /268 variables (removed 12) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 256 cols
[2024-05-31 23:07:36] [INFO ] Computed 61 invariants in 3 ms
[2024-05-31 23:07:36] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 23:07:36] [INFO ] Invariant cache hit.
[2024-05-31 23:07:36] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/268 places, 201/213 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48731 ms. Remains : 256/268 places, 201/213 transitions.
[2024-05-31 23:07:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47660 resets) in 2750 ms. (363 steps per ms)
BEST_FIRST walk for 1000001 steps (9108 resets) in 1035 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:07:40] [INFO ] Invariant cache hit.
[2024-05-31 23:07:40] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:07:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-31 23:07:40] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-31 23:07:40] [INFO ] Computed and/alt/rep : 187/341/187 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:07:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:07:40] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-31 23:07:40] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-31 23:07:40] [INFO ] Computed and/alt/rep : 187/341/187 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-31 23:07:41] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-31 23:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 23:07:41] [INFO ] Added : 149 causal constraints over 30 iterations in 537 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 201/201 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 256/256 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 256 /256 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-31 23:07:41] [INFO ] Invariant cache hit.
[2024-05-31 23:07:41] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-31 23:07:41] [INFO ] Invariant cache hit.
[2024-05-31 23:07:42] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-31 23:07:42] [INFO ] Redundant transitions in 0 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-31 23:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/253 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:07:45] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 2/255 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 201/456 variables, 255/317 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:07:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:07:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:07:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:07:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:07:49] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/457 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/457 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 17 (OVERLAPS) 0/457 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 331 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22404 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/253 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 2/255 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 201/456 variables, 255/332 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 198/530 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-31 23:08:19] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/457 variables, and 531 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 255/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 17/18 constraints]
After SMT, in 52508ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52931 ms. Remains : 256/256 places, 201/201 transitions.
RANDOM walk for 40000 steps (1881 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (365 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (379 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 569868 steps, run visited all 2 properties in 2394 ms. (steps per millisecond=238 )
Probabilistic random walk after 569868 steps, saw 144054 distinct states, run finished after 2394 ms. (steps per millisecond=238 ) properties seen :2
FORMULA DES-PT-40b-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40b-UpperBounds-09 in 116576 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 223 rows 281 cols
[2024-05-31 23:08:37] [INFO ] Computed 64 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (450 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (105 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:08:37] [INFO ] Invariant cache hit.
[2024-05-31 23:08:37] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:08:37] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:08:37] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-31 23:08:37] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:08:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2024-05-31 23:08:37] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:08:37] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-31 23:08:37] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:08:38] [INFO ] Added : 178 causal constraints over 36 iterations in 579 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 281 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p131) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 222/222 transitions.
Graph (complete) has 954 edges and 281 vertex of which 276 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 274 transition count 219
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 274 transition count 219
Applied a total of 4 rules in 20 ms. Remains 274 /281 variables (removed 7) and now considering 219/222 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 274/281 places, 219/222 transitions.
// Phase 1: matrix 219 rows 274 cols
[2024-05-31 23:08:39] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47994 resets) in 2890 ms. (345 steps per ms)
BEST_FIRST walk for 1000001 steps (9238 resets) in 1040 ms. (960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:08:43] [INFO ] Invariant cache hit.
[2024-05-31 23:08:43] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:08:43] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:08:43] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 23:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:08:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:08:43] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:08:43] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 23:08:43] [INFO ] Computed and/alt/rep : 205/377/205 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:08:44] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 23:08:44] [INFO ] Added : 201 causal constraints over 41 iterations in 758 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 274/274 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-31 23:08:44] [INFO ] Invariant cache hit.
[2024-05-31 23:08:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 23:08:44] [INFO ] Invariant cache hit.
[2024-05-31 23:08:45] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-31 23:08:45] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-31 23:08:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/272 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 1/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 219/492 variables, 273/335 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-31 23:08:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 1/493 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 13 (OVERLAPS) 0/493 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 340 constraints, problems are : Problem set: 0 solved, 216 unsolved in 18851 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 2/272 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/273 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 219/492 variables, 273/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 216/555 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-31 23:09:23] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/493 variables, and 556 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 273/274 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
After SMT, in 48981ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 48984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49477 ms. Remains : 274/274 places, 219/219 transitions.
RANDOM walk for 40000 steps (1931 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (383 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (351 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 664018 steps, run visited all 2 properties in 2674 ms. (steps per millisecond=248 )
Probabilistic random walk after 664018 steps, saw 167493 distinct states, run finished after 2674 ms. (steps per millisecond=248 ) properties seen :2
FORMULA DES-PT-40b-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40b-UpperBounds-11 in 59823 ms.
[2024-05-31 23:09:37] [INFO ] Flatten gal took : 60 ms
Total runtime 489930 ms.
ITS solved all properties within timeout

BK_STOP 1717196977338

--------------------
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

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="DES-PT-40b"
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 DES-PT-40b, 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 r480-tall-171624189900725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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