fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r488-tall-171631133100645
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DoubleLock-PT-p3s3

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12942.443 830289.00 962720.00 2228.20 1 1 ? 1 1 1 0 0 1 1 ? 1 10 1 0 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.r488-tall-171631133100645.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 DoubleLock-PT-p3s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 DoubleLock-PT-p3s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717203227200

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:53:48] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-01 00:53:48] [INFO ] Transformed 306 places.
[2024-06-01 00:53:48] [INFO ] Transformed 3136 transitions.
[2024-06-01 00:53:48] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 68 places in 12 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 00:53:48] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2024-06-01 00:53:48] [INFO ] Computed 4 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 10, 1, 1]
RANDOM walk for 10000 steps (92 resets) in 56 ms. (175 steps per ms)
FORMULA DoubleLock-PT-p3s3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (76 resets) in 88 ms. (561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3, 10, 0, 0] Max Struct:[1, +inf, +inf, 1, 1]
[2024-06-01 00:53:48] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-06-01 00:53:48] [INFO ] Invariant cache hit.
[2024-06-01 00:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:53:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:53:49] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2024-06-01 00:53:49] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-01 00:53:49] [INFO ] [Real]Added 143 Read/Feed constraints in 49 ms returned sat
[2024-06-01 00:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:53:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:53:50] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-06-01 00:53:50] [INFO ] [Nat]Added 143 Read/Feed constraints in 170 ms returned sat
[2024-06-01 00:53:50] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 275 ms.
[2024-06-01 00:53:50] [INFO ] Added : 0 causal constraints over 0 iterations in 428 ms. Result :sat
Minimization took 556 ms.
[2024-06-01 00:53:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:53:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:53:51] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-01 00:53:51] [INFO ] [Real]Added 143 Read/Feed constraints in 89 ms returned sat
[2024-06-01 00:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:53:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:53:52] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2024-06-01 00:53:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:53:53] [INFO ] [Nat]Added 143 Read/Feed constraints in 1025 ms returned unknown
[2024-06-01 00:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 00:53:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:53:53] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-01 00:53:53] [INFO ] [Real]Added 143 Read/Feed constraints in 182 ms returned sat
[2024-06-01 00:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:53:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:53:54] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-06-01 00:53:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:53:55] [INFO ] [Nat]Added 143 Read/Feed constraints in 1026 ms returned unknown
[2024-06-01 00:53:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:53:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 00:53:55] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-06-01 00:53:55] [INFO ] [Real]Added 143 Read/Feed constraints in 45 ms returned sat
[2024-06-01 00:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:53:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:53:56] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2024-06-01 00:53:56] [INFO ] [Nat]Added 143 Read/Feed constraints in 95 ms returned sat
[2024-06-01 00:53:56] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 339 ms.
[2024-06-01 00:53:56] [INFO ] Added : 0 causal constraints over 0 iterations in 473 ms. Result :sat
Minimization took 552 ms.
[2024-06-01 00:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:53:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:53:57] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-01 00:53:57] [INFO ] [Real]Added 143 Read/Feed constraints in 52 ms returned sat
[2024-06-01 00:53:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 00:53:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:53:58] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-06-01 00:53:58] [INFO ] [Nat]Added 143 Read/Feed constraints in 167 ms returned sat
[2024-06-01 00:53:58] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 175 ms.
[2024-06-01 00:53:58] [INFO ] Added : 0 causal constraints over 0 iterations in 303 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3, 10, 0, 0] Max Struct:[1, +inf, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3, 10, 0, 0] Max Struct:[1, +inf, +inf, 1, 1]
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 235 transition count 2976
Applied a total of 33 rules in 147 ms. Remains 235 /238 variables (removed 3) and now considering 2976/3008 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 235/238 places, 2976/3008 transitions.
[2024-06-01 00:53:59] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1180=1, 1992=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1162=1, 1974=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 144 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :[0, 2, 4, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3, 10, 1, 0] Max Struct:[1, +inf, +inf, 1, 1]
[2024-06-01 00:54:00] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2024-06-01 00:54:00] [INFO ] Computed 3 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 10, 1, 0] Max Struct:[1, +inf, +inf, 1, 1]
FORMULA DoubleLock-PT-p3s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9514 resets) in 1891 ms. (528 steps per ms)
FORMULA DoubleLock-PT-p3s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (3035 resets) in 1336 ms. (1495 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 15] Max Struct:[+inf, +inf]
[2024-06-01 00:54:03] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:03] [INFO ] Invariant cache hit.
[2024-06-01 00:54:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:54:03] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-06-01 00:54:03] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-01 00:54:03] [INFO ] [Real]Added 143 Read/Feed constraints in 132 ms returned sat
[2024-06-01 00:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:54:04] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-01 00:54:05] [INFO ] [Nat]Added 143 Read/Feed constraints in 1251 ms returned sat
[2024-06-01 00:54:05] [INFO ] Deduced a trap composed of 94 places in 323 ms of which 15 ms to minimize.
[2024-06-01 00:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2024-06-01 00:54:06] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 177 ms.
[2024-06-01 00:54:06] [INFO ] Added : 1 causal constraints over 1 iterations in 382 ms. Result :sat
Minimization took 4417 ms.
[2024-06-01 00:54:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 00:54:11] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2024-06-01 00:54:11] [INFO ] [Real]Added 143 Read/Feed constraints in 287 ms returned sat
[2024-06-01 00:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:54:11] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-06-01 00:54:12] [INFO ] [Nat]Added 143 Read/Feed constraints in 425 ms returned sat
[2024-06-01 00:54:12] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 176 ms.
[2024-06-01 00:54:13] [INFO ] Added : 2 causal constraints over 2 iterations in 633 ms. Result :sat
Minimization took 2469 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 15] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 15] Max Struct:[+inf, +inf]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 60 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 235/235 places, 2976/2976 transitions.
[2024-06-01 00:54:16] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1180=1, 1992=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1162=1, 1974=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 141 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :[2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 15] Max Struct:[+inf, +inf]
[2024-06-01 00:54:16] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 15] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (9497 resets) in 1783 ms. (560 steps per ms)
BEST_FIRST walk for 2000002 steps (2955 resets) in 1235 ms. (1618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 16] Max Struct:[+inf, +inf]
[2024-06-01 00:54:19] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:19] [INFO ] Invariant cache hit.
[2024-06-01 00:54:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:54:20] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-01 00:54:20] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-01 00:54:20] [INFO ] [Real]Added 143 Read/Feed constraints in 162 ms returned sat
[2024-06-01 00:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:54:20] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-06-01 00:54:23] [INFO ] [Nat]Added 143 Read/Feed constraints in 2579 ms returned sat
[2024-06-01 00:54:23] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 156 ms.
[2024-06-01 00:54:23] [INFO ] Added : 1 causal constraints over 1 iterations in 338 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 00:54:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:54:28] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-06-01 00:54:28] [INFO ] [Real]Added 143 Read/Feed constraints in 271 ms returned sat
[2024-06-01 00:54:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:54:29] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-06-01 00:54:29] [INFO ] [Nat]Added 143 Read/Feed constraints in 425 ms returned sat
[2024-06-01 00:54:29] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 160 ms.
[2024-06-01 00:54:30] [INFO ] Added : 2 causal constraints over 2 iterations in 604 ms. Result :sat
Minimization took 2503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 16] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 16] Max Struct:[+inf, +inf]
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 52 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 66 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2024-06-01 00:54:33] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:33] [INFO ] Invariant cache hit.
[2024-06-01 00:54:33] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 00:54:33] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:33] [INFO ] Invariant cache hit.
[2024-06-01 00:54:33] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-01 00:54:36] [INFO ] Implicit Places using invariants and state equation in 2913 ms returned []
Implicit Place search using SMT with State Equation took 3249 ms to find 0 implicit places.
[2024-06-01 00:54:36] [INFO ] Redundant transitions in 154 ms returned []
Running 2974 sub problems to find dead transitions.
[2024-06-01 00:54:36] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
[2024-06-01 00:54:36] [INFO ] Invariant cache hit.
[2024-06-01 00:54:36] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/2324 variables, and 3 constraints, problems are : Problem set: 0 solved, 2974 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/235 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 2974/2974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2974 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2974 unsolved
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 2 ms to minimize.
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
Problem TDEAD1984 is UNSAT
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 2 ms to minimize.
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 4 ms to minimize.
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2091 is UNSAT
[2024-06-01 00:55:33] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 4 ms to minimize.
[2024-06-01 00:55:33] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 2 ms to minimize.
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
[2024-06-01 00:55:33] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 3 ms to minimize.
[2024-06-01 00:55:34] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
[2024-06-01 00:55:34] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 2 ms to minimize.
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2244 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2246 is UNSAT
Problem TDEAD2247 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2257 is UNSAT
Problem TDEAD2258 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2273 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2307 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2321 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2360 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2366 is UNSAT
Problem TDEAD2368 is UNSAT
Problem TDEAD2369 is UNSAT
Problem TDEAD2370 is UNSAT
Problem TDEAD2371 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2819 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2821 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2834 is UNSAT
Problem TDEAD2835 is UNSAT
Problem TDEAD2836 is UNSAT
Problem TDEAD2837 is UNSAT
Problem TDEAD2838 is UNSAT
Problem TDEAD2839 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2841 is UNSAT
Problem TDEAD2842 is UNSAT
Problem TDEAD2843 is UNSAT
Problem TDEAD2844 is UNSAT
Problem TDEAD2845 is UNSAT
Problem TDEAD2846 is UNSAT
Problem TDEAD2847 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/12 constraints. Problems are: Problem set: 576 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/2324 variables, and 12 constraints, problems are : Problem set: 576 solved, 2398 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/235 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 0/2974 constraints, Known Traps: 9/9 constraints]
After SMT, in 67233ms problems are : Problem set: 576 solved, 2398 unsolved
Search for dead transitions found 576 dead transitions in 67279ms
Found 576 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 576 transitions
Dead transitions reduction (with SMT) removed 576 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/235 places, 2400/2976 transitions.
Graph (complete) has 4088 edges and 235 vertex of which 203 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 203 /235 variables (removed 32) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 00:55:43] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-06-01 00:55:43] [INFO ] Computed 2 invariants in 13 ms
[2024-06-01 00:55:44] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 00:55:44] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:55:44] [INFO ] Invariant cache hit.
[2024-06-01 00:55:44] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:55:46] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/235 places, 2400/2976 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 73358 ms. Remains : 203/235 places, 2400/2976 transitions.
[2024-06-01 00:55:46] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 141 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :[1, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 16] Max Struct:[+inf, +inf]
[2024-06-01 00:55:47] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:55:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 16] Max Struct:[+inf, +inf]
RANDOM walk for 1000007 steps (9528 resets) in 1490 ms. (670 steps per ms)
BEST_FIRST walk for 2000001 steps (3001 resets) in 1119 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
[2024-06-01 00:55:49] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:55:49] [INFO ] Invariant cache hit.
[2024-06-01 00:55:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:55:50] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-01 00:55:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:55:50] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-06-01 00:55:50] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:55:50] [INFO ] [Nat]Added 137 Read/Feed constraints in 504 ms returned sat
[2024-06-01 00:55:50] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 108 ms.
[2024-06-01 00:55:51] [INFO ] Added : 0 causal constraints over 0 iterations in 197 ms. Result :sat
Minimization took 3320 ms.
[2024-06-01 00:55:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:55:54] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-01 00:55:54] [INFO ] [Real]Added 137 Read/Feed constraints in 31 ms returned sat
[2024-06-01 00:55:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:55:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 00:55:55] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-06-01 00:55:55] [INFO ] [Nat]Added 137 Read/Feed constraints in 110 ms returned sat
[2024-06-01 00:55:55] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 110 ms.
[2024-06-01 00:55:55] [INFO ] Added : 2 causal constraints over 2 iterations in 465 ms. Result :sat
Minimization took 2344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 00:55:58] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:55:58] [INFO ] Invariant cache hit.
[2024-06-01 00:55:58] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 00:55:58] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:55:58] [INFO ] Invariant cache hit.
[2024-06-01 00:55:58] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:56:00] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-06-01 00:56:00] [INFO ] Redundant transitions in 118 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 00:56:00] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:56:00] [INFO ] Invariant cache hit.
[2024-06-01 00:56:00] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65645ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68327 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 00:57:06] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 135 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :[2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
[2024-06-01 00:57:07] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:57:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (9521 resets) in 1498 ms. (667 steps per ms)
BEST_FIRST walk for 2000002 steps (2957 resets) in 1122 ms. (1780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
[2024-06-01 00:57:09] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:57:09] [INFO ] Invariant cache hit.
[2024-06-01 00:57:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:57:10] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-06-01 00:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:57:10] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-06-01 00:57:10] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:57:11] [INFO ] [Nat]Added 137 Read/Feed constraints in 529 ms returned sat
[2024-06-01 00:57:11] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 112 ms.
[2024-06-01 00:57:11] [INFO ] Added : 0 causal constraints over 0 iterations in 204 ms. Result :sat
Minimization took 3364 ms.
[2024-06-01 00:57:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:57:14] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-06-01 00:57:15] [INFO ] [Real]Added 137 Read/Feed constraints in 30 ms returned sat
[2024-06-01 00:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:57:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:57:15] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-06-01 00:57:15] [INFO ] [Nat]Added 137 Read/Feed constraints in 111 ms returned sat
[2024-06-01 00:57:15] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 132 ms.
[2024-06-01 00:57:15] [INFO ] Added : 2 causal constraints over 2 iterations in 494 ms. Result :sat
Minimization took 2339 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 33 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 33 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 00:57:18] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:57:18] [INFO ] Invariant cache hit.
[2024-06-01 00:57:18] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 00:57:18] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:57:18] [INFO ] Invariant cache hit.
[2024-06-01 00:57:18] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:57:20] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2024-06-01 00:57:21] [INFO ] Redundant transitions in 52 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 00:57:21] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:57:21] [INFO ] Invariant cache hit.
[2024-06-01 00:57:21] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65776ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65797ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68309 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 00:58:26] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 150 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :[2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
RANDOM walk for 40000 steps (378 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 278339 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 278339 steps, saw 206266 distinct states, run finished after 3008 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-01 00:58:30] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:58:30] [INFO ] Invariant cache hit.
[2024-06-01 00:58:30] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 80/1767 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1767 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/1806 variables, 29/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 134/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 80/1767 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1767 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 39/1806 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 134/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:58:32] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 2 ms to minimize.
[2024-06-01 00:58:32] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 2 ms to minimize.
[2024-06-01 00:58:32] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 1 ms to minimize.
[2024-06-01 00:58:33] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2591ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 203/203 places, 2400/2400 transitions.
RANDOM walk for 40001 steps (380 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (69 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 313602 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 313602 steps, saw 231832 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 00:58:36] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:58:36] [INFO ] Invariant cache hit.
[2024-06-01 00:58:36] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 80/1767 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1767 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/1806 variables, 29/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 134/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1687 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 80/1767 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1767 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 39/1806 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 134/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:58:38] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 2 ms to minimize.
[2024-06-01 00:58:38] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 2 ms to minimize.
[2024-06-01 00:58:39] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 2 ms to minimize.
[2024-06-01 00:58:39] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2637ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 263 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 39 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 32 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 00:58:39] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:58:39] [INFO ] Invariant cache hit.
[2024-06-01 00:58:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:58:40] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:58:40] [INFO ] Invariant cache hit.
[2024-06-01 00:58:40] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:58:42] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-06-01 00:58:42] [INFO ] Redundant transitions in 51 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 00:58:42] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:58:42] [INFO ] Invariant cache hit.
[2024-06-01 00:58:42] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66086ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68705 ms. Remains : 203/203 places, 2400/2400 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Iterating post reduction 0 with 797 rules applied. Total rules applied 797 place count 203 transition count 1603
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 797 place count 203 transition count 1596
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 811 place count 196 transition count 1596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 815 place count 194 transition count 1594
Applied a total of 815 rules in 43 ms. Remains 194 /203 variables (removed 9) and now considering 1594/2400 (removed 806) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1594 rows 194 cols
[2024-06-01 00:59:48] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 00:59:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:59:49] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:59:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 00:59:49] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 00:59:49] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 00:59:49] [INFO ] After 81ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:59:49] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:59:49] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1061 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5, 17] Max Struct:[+inf, +inf]
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 00:59:49] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-06-01 00:59:49] [INFO ] Computed 2 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (93 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:59:49] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:59:49] [INFO ] Invariant cache hit.
[2024-06-01 00:59:49] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 00:59:50] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-01 00:59:50] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:59:50] [INFO ] [Real]Added 137 Read/Feed constraints in 69 ms returned sat
[2024-06-01 00:59:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:59:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:59:50] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-01 00:59:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:59:51] [INFO ] [Nat]Added 137 Read/Feed constraints in 585 ms returned sat
[2024-06-01 00:59:51] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 114 ms.
[2024-06-01 00:59:51] [INFO ] Added : 0 causal constraints over 0 iterations in 211 ms. Result :sat
Minimization took 629 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 39 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 00:59:51] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 148 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:59:52] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:59:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9547 resets) in 1577 ms. (633 steps per ms)
BEST_FIRST walk for 1000001 steps (1648 resets) in 561 ms. (1779 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 00:59:54] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:59:54] [INFO ] Invariant cache hit.
[2024-06-01 00:59:54] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-06-01 00:59:55] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-06-01 00:59:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:59:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 00:59:55] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-06-01 00:59:55] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 00:59:55] [INFO ] [Nat]Added 137 Read/Feed constraints in 511 ms returned sat
[2024-06-01 00:59:56] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 111 ms.
[2024-06-01 00:59:56] [INFO ] Added : 0 causal constraints over 0 iterations in 201 ms. Result :sat
Minimization took 3345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 32 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 32 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 00:59:59] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:59:59] [INFO ] Invariant cache hit.
[2024-06-01 00:59:59] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 00:59:59] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 00:59:59] [INFO ] Invariant cache hit.
[2024-06-01 01:00:00] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:00:02] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2024-06-01 01:00:02] [INFO ] Redundant transitions in 53 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:00:02] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:00:02] [INFO ] Invariant cache hit.
[2024-06-01 01:00:02] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66214ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68836 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 01:01:08] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 146 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 01:01:09] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:01:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000003 steps (9488 resets) in 1667 ms. (599 steps per ms)
BEST_FIRST walk for 1000001 steps (1650 resets) in 712 ms. (1402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 01:01:11] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:01:11] [INFO ] Invariant cache hit.
[2024-06-01 01:01:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:01:11] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-06-01 01:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:01:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 01:01:12] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-01 01:01:12] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:01:12] [INFO ] [Nat]Added 137 Read/Feed constraints in 517 ms returned sat
[2024-06-01 01:01:13] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 131 ms.
[2024-06-01 01:01:13] [INFO ] Added : 0 causal constraints over 0 iterations in 253 ms. Result :sat
Minimization took 3445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 48 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 32 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 01:01:16] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:01:16] [INFO ] Invariant cache hit.
[2024-06-01 01:01:16] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 01:01:16] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:01:16] [INFO ] Invariant cache hit.
[2024-06-01 01:01:17] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:01:19] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2024-06-01 01:01:19] [INFO ] Redundant transitions in 49 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:01:19] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:01:19] [INFO ] Invariant cache hit.
[2024-06-01 01:01:19] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 31014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 66141ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 66161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68762 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 01:02:25] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 148 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40006 steps (380 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (66 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 466253 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 466253 steps, saw 342503 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-06-01 01:02:29] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:02:29] [INFO ] Invariant cache hit.
[2024-06-01 01:02:29] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/1762 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1762 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/1806 variables, 33/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 135/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1762 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 71/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 135/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:02:30] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 203/203 places, 2400/2400 transitions.
RANDOM walk for 40011 steps (369 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (62 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464340 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464340 steps, saw 341118 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-01 01:02:33] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:02:33] [INFO ] Invariant cache hit.
[2024-06-01 01:02:33] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/1762 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1762 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/1806 variables, 33/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1806 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 135/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1806 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1681 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1681 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1762 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1762 variables, 71/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1762 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 135/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:02:34] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 34 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 46 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 01:02:35] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:02:35] [INFO ] Invariant cache hit.
[2024-06-01 01:02:35] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-01 01:02:35] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:02:35] [INFO ] Invariant cache hit.
[2024-06-01 01:02:35] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:02:37] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
[2024-06-01 01:02:37] [INFO ] Redundant transitions in 53 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:02:37] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:02:37] [INFO ] Invariant cache hit.
[2024-06-01 01:02:37] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65695ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68313 ms. Remains : 203/203 places, 2400/2400 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Iterating post reduction 0 with 797 rules applied. Total rules applied 797 place count 203 transition count 1603
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 797 place count 203 transition count 1595
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 813 place count 195 transition count 1595
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 1 with 4 rules applied. Total rules applied 817 place count 193 transition count 1593
Applied a total of 817 rules in 41 ms. Remains 193 /203 variables (removed 10) and now considering 1593/2400 (removed 807) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1593 rows 193 cols
[2024-06-01 01:03:43] [INFO ] Computed 2 invariants in 19 ms
[2024-06-01 01:03:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:03:44] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:03:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:03:44] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 01:03:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 01:03:44] [INFO ] After 45ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:03:44] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 1 ms to minimize.
[2024-06-01 01:03:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
TRAPS : Iteration 1
[2024-06-01 01:03:45] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:03:45] [INFO ] After 945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1438 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-02 in 235419 ms.
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 01:03:45] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
// Phase 1: matrix 1603 rows 203 cols
[2024-06-01 01:03:45] [INFO ] Computed 2 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (96 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10000 steps (13 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-06-01 01:03:45] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:45] [INFO ] Invariant cache hit.
[2024-06-01 01:03:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 01:03:45] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-01 01:03:45] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:03:45] [INFO ] [Real]Added 137 Read/Feed constraints in 51 ms returned sat
[2024-06-01 01:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:03:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:03:45] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-01 01:03:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:03:46] [INFO ] [Nat]Added 137 Read/Feed constraints in 1017 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 37 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 01:03:46] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 142 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-06-01 01:03:47] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000002 steps (9539 resets) in 1488 ms. (671 steps per ms)
BEST_FIRST walk for 1000001 steps (1325 resets) in 582 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-06-01 01:03:49] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:49] [INFO ] Invariant cache hit.
[2024-06-01 01:03:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 01:03:49] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-01 01:03:49] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:03:50] [INFO ] [Real]Added 137 Read/Feed constraints in 27 ms returned sat
[2024-06-01 01:03:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:03:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:03:50] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-06-01 01:03:50] [INFO ] [Nat]Added 137 Read/Feed constraints in 111 ms returned sat
[2024-06-01 01:03:50] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 110 ms.
[2024-06-01 01:03:50] [INFO ] Added : 2 causal constraints over 2 iterations in 468 ms. Result :sat
Minimization took 2406 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 31 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 31 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 01:03:53] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:53] [INFO ] Invariant cache hit.
[2024-06-01 01:03:53] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 01:03:53] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:53] [INFO ] Invariant cache hit.
[2024-06-01 01:03:53] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:03:55] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2024-06-01 01:03:56] [INFO ] Redundant transitions in 53 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:03:56] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:03:56] [INFO ] Invariant cache hit.
[2024-06-01 01:03:56] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65950ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68478 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 01:05:01] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 141 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-06-01 01:05:02] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:05:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000006 steps (9582 resets) in 1540 ms. (648 steps per ms)
BEST_FIRST walk for 1000001 steps (1351 resets) in 570 ms. (1751 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-06-01 01:05:04] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:05:04] [INFO ] Invariant cache hit.
[2024-06-01 01:05:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:05:05] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-01 01:05:05] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:05:05] [INFO ] [Real]Added 137 Read/Feed constraints in 28 ms returned sat
[2024-06-01 01:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:05:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 01:05:05] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-06-01 01:05:05] [INFO ] [Nat]Added 137 Read/Feed constraints in 110 ms returned sat
[2024-06-01 01:05:05] [INFO ] Computed and/alt/rep : 123/685/123 causal constraints (skipped 1478 transitions) in 111 ms.
[2024-06-01 01:05:06] [INFO ] Added : 2 causal constraints over 2 iterations in 472 ms. Result :sat
Minimization took 2397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 31 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 30 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 01:05:08] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:05:08] [INFO ] Invariant cache hit.
[2024-06-01 01:05:08] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 01:05:08] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:05:08] [INFO ] Invariant cache hit.
[2024-06-01 01:05:09] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:05:11] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2024-06-01 01:05:11] [INFO ] Redundant transitions in 52 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:05:11] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:05:11] [INFO ] Invariant cache hit.
[2024-06-01 01:05:11] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30826 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65847ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68406 ms. Remains : 203/203 places, 2400/2400 transitions.
[2024-06-01 01:06:17] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
Found an invariant !
This invariant on transitions {18=1, 31=1, 1252=1, 1577=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 31=1, 1214=1, 1540=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 147 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40018 steps (382 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 473526 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 473526 steps, saw 347774 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2024-06-01 01:06:20] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:06:20] [INFO ] Invariant cache hit.
[2024-06-01 01:06:20] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1616/1682 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1682 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/1763 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1763 variables, 71/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:06:21] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 2 ms to minimize.
[2024-06-01 01:06:21] [INFO ] Deduced a trap composed of 157 places in 126 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 136/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1616/1682 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1682 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1682 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1763 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1763 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/1806 variables, 33/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 136/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 31 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 203/203 places, 2400/2400 transitions.
RANDOM walk for 40014 steps (375 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 470474 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 470474 steps, saw 345564 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-06-01 01:06:25] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:06:25] [INFO ] Invariant cache hit.
[2024-06-01 01:06:25] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1616/1682 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1682 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/1763 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1763 variables, 71/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:06:25] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 1 ms to minimize.
[2024-06-01 01:06:26] [INFO ] Deduced a trap composed of 157 places in 114 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/1806 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1806 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 136/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1806 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1616/1682 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1682 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1682 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1763 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1763 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1763 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/1806 variables, 33/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 136/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1806 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 31 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 203/203 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2400/2400 transitions.
Applied a total of 0 rules in 33 ms. Remains 203 /203 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-06-01 01:06:27] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:06:27] [INFO ] Invariant cache hit.
[2024-06-01 01:06:27] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 01:06:27] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:06:27] [INFO ] Invariant cache hit.
[2024-06-01 01:06:27] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-01 01:06:29] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-06-01 01:06:29] [INFO ] Redundant transitions in 53 ms returned []
Running 2398 sub problems to find dead transitions.
[2024-06-01 01:06:29] [INFO ] Flow matrix only has 1603 transitions (discarded 797 similar events)
[2024-06-01 01:06:29] [INFO ] Invariant cache hit.
[2024-06-01 01:06:29] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 342 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 2 (OVERLAPS) 1603/1806 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1806 variables, 137/342 constraints. Problems are: Problem set: 0 solved, 2398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 2740 constraints, problems are : Problem set: 0 solved, 2398 unsolved in 30833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 2398/2398 constraints, Known Traps: 0/0 constraints]
After SMT, in 65776ms problems are : Problem set: 0 solved, 2398 unsolved
Search for dead transitions found 0 dead transitions in 65796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68378 ms. Remains : 203/203 places, 2400/2400 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Iterating post reduction 0 with 797 rules applied. Total rules applied 797 place count 203 transition count 1603
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 797 place count 203 transition count 1595
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 813 place count 195 transition count 1595
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 1 with 4 rules applied. Total rules applied 817 place count 193 transition count 1593
Applied a total of 817 rules in 40 ms. Remains 193 /203 variables (removed 10) and now considering 1593/2400 (removed 807) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1593 rows 193 cols
[2024-06-01 01:07:35] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 01:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 01:07:36] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:07:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 01:07:36] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 01:07:36] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 01:07:36] [INFO ] After 138ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:07:36] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:07:36] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1211 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-10 in 231726 ms.
[2024-06-01 01:07:37] [INFO ] Flatten gal took : 215 ms
[2024-06-01 01:07:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 01:07:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 203 places, 2400 transitions and 9520 arcs took 13 ms.
Total runtime 828902 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleLock-PT-p3s3-UpperBounds-02
Could not compute solution for formula : DoubleLock-PT-p3s3-UpperBounds-10

BK_STOP 1717204057489

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p3s3"
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 DoubleLock-PT-p3s3, 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 r488-tall-171631133100645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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