About the Execution of LTSMin+red for Dekker-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16056.428 | 653105.00 | 1117182.00 | 1131.90 | FFFFFFFTFFFFFFF? | 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-171631131900115.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 Dekker-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631131900115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.9M 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-100-LTLCardinality-00
FORMULA_NAME Dekker-PT-100-LTLCardinality-01
FORMULA_NAME Dekker-PT-100-LTLCardinality-02
FORMULA_NAME Dekker-PT-100-LTLCardinality-03
FORMULA_NAME Dekker-PT-100-LTLCardinality-04
FORMULA_NAME Dekker-PT-100-LTLCardinality-05
FORMULA_NAME Dekker-PT-100-LTLCardinality-06
FORMULA_NAME Dekker-PT-100-LTLCardinality-07
FORMULA_NAME Dekker-PT-100-LTLCardinality-08
FORMULA_NAME Dekker-PT-100-LTLCardinality-09
FORMULA_NAME Dekker-PT-100-LTLCardinality-10
FORMULA_NAME Dekker-PT-100-LTLCardinality-11
FORMULA_NAME Dekker-PT-100-LTLCardinality-12
FORMULA_NAME Dekker-PT-100-LTLCardinality-13
FORMULA_NAME Dekker-PT-100-LTLCardinality-14
FORMULA_NAME Dekker-PT-100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717185758097
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:02:39] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2024-05-31 20:02:39] [INFO ] Transformed 500 places.
[2024-05-31 20:02:39] [INFO ] Transformed 10200 transitions.
[2024-05-31 20:02:39] [INFO ] Found NUPN structural information;
[2024-05-31 20:02:39] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 631 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 365 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:02:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-31 20:02:40] [INFO ] Computed 300 invariants in 30 ms
[2024-05-31 20:02:47] [INFO ] Implicit Places using invariants in 7447 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 278, 281, 284, 290, 293, 296, 299, 302, 305, 311, 314, 317, 320, 323, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 455, 458, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 7487 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 409/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 247 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8119 ms. Remains : 409/500 places, 10200/10200 transitions.
Support contains 45 out of 409 places after structural reductions.
[2024-05-31 20:02:49] [INFO ] Flatten gal took : 689 ms
[2024-05-31 20:02:49] [INFO ] Flatten gal took : 433 ms
[2024-05-31 20:02:50] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 43 out of 409 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (8 resets) in 2405 ms. (16 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
[2024-05-31 20:02:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-31 20:02:51] [INFO ] Computed 209 invariants in 6 ms
[2024-05-31 20:02:51] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 94/809 variables, 102/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 94/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 94/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1334 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 3/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:02:53] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 2 ms to minimize.
[2024-05-31 20:02:53] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 2 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/715 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-31 20:02:57] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
SMT process timed out in 6528ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 634 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 409/409 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1169 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 182810 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 182810 steps, saw 168458 distinct states, run finished after 3011 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-31 20:03:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:03:02] [INFO ] Invariant cache hit.
[2024-05-31 20:03:02] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 94/809 variables, 102/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 94/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 8/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 94/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/809 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 1133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1106 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/18 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/24 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/49 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 188/237 variables, 100/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 478/715 variables, 290/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 290/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/715 variables, 86/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 3/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/715 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 94/809 variables, 102/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 94/1034 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/809 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/809 variables, 94/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/809 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/809 variables, 20/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/809 variables, 20/1196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/809 variables, 20/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/809 variables, 20/1236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/809 variables, 9/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:03:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/809 variables, 2/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/809 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/809 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 1247 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9945 ms.
Refiners :[Domain max(s): 409/409 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 409/409 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 117/117 constraints]
After SMT, in 11135ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1312 ms.
Support contains 6 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 365 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 409/409 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 440 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:03:15] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:03:15] [INFO ] Invariant cache hit.
[2024-05-31 20:03:17] [INFO ] Implicit Places using invariants in 2068 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2082 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 347 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2870 ms. Remains : 400/409 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1099 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 212504 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 3
Probabilistic random walk after 212504 steps, saw 195661 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 20:03:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-31 20:03:21] [INFO ] Computed 200 invariants in 11 ms
[2024-05-31 20:03:21] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:03:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/24 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/48 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 188/236 variables, 100/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 470/706 variables, 282/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/706 variables, 282/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 94/824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/706 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 94/800 variables, 94/918 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 94/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 94/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/800 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/800 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1106 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1043 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/17 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/24 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/48 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 188/236 variables, 100/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 470/706 variables, 282/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/706 variables, 282/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 94/824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/706 variables, 3/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/706 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/706 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/706 variables, 7/837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/706 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/706 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 94/800 variables, 94/933 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 94/1027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 94/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 20/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 20/1161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:03:29] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/800 variables, 20/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/800 variables, 20/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:03:33] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/800 variables, 20/1221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:35] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:03:36] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/800 variables, 20/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:03:37] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:03:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/800 variables, 18/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/800 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/800 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16328 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 156/156 constraints]
After SMT, in 17456ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1819 ms.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 349 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 966 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 273104 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 273104 steps, saw 250694 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-31 20:03:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:03:44] [INFO ] Invariant cache hit.
[2024-05-31 20:03:44] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/800 variables, 96/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 96/1101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/800 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/800 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/16 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/32 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 192/224 variables, 100/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 480/704 variables, 288/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 288/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 96/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 96/800 variables, 96/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/800 variables, 96/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/800 variables, 96/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/800 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 1/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 2/1110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/800 variables, 1/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/800 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/800 variables, 3/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/800 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/800 variables, 1/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/800 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
At refinement iteration 33 (OVERLAPS) 0/800 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/800 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/800 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/800 variables, 3/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/800 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/800 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/800 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/800 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/800 variables, 6/1137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:03:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 4/1141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 4/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:03:51] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 45 (OVERLAPS) 0/800 variables, 5/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/800 variables, 10/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/800 variables, 8/1168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/800 variables, 4/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/800 variables, 7/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/800 variables, 5/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/800 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 52 (OVERLAPS) 0/800 variables, 6/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/800 variables, 2/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/800 variables, 10/1202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/800 variables, 5/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/800 variables, 1/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/800 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 0/800 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13085 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 106/106 constraints]
After SMT, in 13810ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 777 ms.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 393 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 366 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:03:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:03:59] [INFO ] Invariant cache hit.
[2024-05-31 20:04:01] [INFO ] Implicit Places using invariants in 1464 ms returned []
Implicit Place search using SMT only with invariants took 1464 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:04:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:04:01] [INFO ] Invariant cache hit.
[2024-05-31 20:04:01] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 50359ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 50485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52367 ms. Remains : 400/400 places, 10200/10200 transitions.
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||!p1) U !(F(!G(p0))||F(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:04:52] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-31 20:04:52] [INFO ] Computed 209 invariants in 6 ms
[2024-05-31 20:04:54] [INFO ] Implicit Places using invariants in 2034 ms returned [218, 245, 260, 275, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2042 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2224 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) p1), p0, true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-00 finished in 2561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 844 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:04:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:04:55] [INFO ] Invariant cache hit.
[2024-05-31 20:04:57] [INFO ] Implicit Places using invariants in 2039 ms returned [218, 245, 260, 275, 288, 373, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2056 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 439 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3340 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 960 reset in 2174 ms.
Stack based approach found an accepted trace after 92 steps with 3 reset with depth 3 and stack size 3 in 3 ms.
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-01 finished in 5612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 92 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:00] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:00] [INFO ] Invariant cache hit.
[2024-05-31 20:05:02] [INFO ] Implicit Places using invariants in 2139 ms returned [218, 245, 260, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2147 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2330 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-02
Product exploration explored 100000 steps with 33321 reset in 1837 ms.
Stack based approach found an accepted trace after 513 steps with 238 reset with depth 38 and stack size 38 in 11 ms.
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-02 finished in 4279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 468 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:05] [INFO ] Invariant cache hit.
[2024-05-31 20:05:07] [INFO ] Implicit Places using invariants in 2073 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2082 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 442 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2994 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 2292 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 2 ms.
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-03 finished in 5352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(p2)))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:09] [INFO ] Invariant cache hit.
[2024-05-31 20:05:12] [INFO ] Implicit Places using invariants in 2087 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2095 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2277 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-04 finished in 2433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:12] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:12] [INFO ] Invariant cache hit.
[2024-05-31 20:05:14] [INFO ] Implicit Places using invariants in 2064 ms returned [218, 245, 260, 275, 288, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2074 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2255 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 264 steps with 0 reset in 9 ms.
FORMULA Dekker-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-05 finished in 2373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:14] [INFO ] Invariant cache hit.
[2024-05-31 20:05:16] [INFO ] Implicit Places using invariants in 2058 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2067 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2246 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 2109 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-09 finished in 4618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:19] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:19] [INFO ] Invariant cache hit.
[2024-05-31 20:05:21] [INFO ] Implicit Places using invariants in 2037 ms returned [218, 245, 260, 275, 288, 373, 380, 403]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2044 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2220 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-11
Product exploration explored 100000 steps with 3760 reset in 2085 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-11 finished in 4446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((p1||X(((p1 U !p2) U (p1&&(p1 U !p2)))))))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 464 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:24] [INFO ] Invariant cache hit.
[2024-05-31 20:05:26] [INFO ] Implicit Places using invariants in 2022 ms returned [218, 245, 275, 288, 373, 380, 403, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2031 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 463 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2959 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-12
Product exploration explored 100000 steps with 922 reset in 2171 ms.
Stack based approach found an accepted trace after 224 steps with 1 reset with depth 151 and stack size 151 in 6 ms.
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-12 finished in 5238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&F(p2))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:29] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:29] [INFO ] Invariant cache hit.
[2024-05-31 20:05:31] [INFO ] Implicit Places using invariants in 2071 ms returned [260, 275, 288, 373, 380, 403, 406]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2080 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 402 /402 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2264 ms. Remains : 402/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLCardinality-13 finished in 2484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&p0))||X(X(F(p2)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:31] [INFO ] Invariant cache hit.
[2024-05-31 20:05:33] [INFO ] Implicit Places using invariants in 1995 ms returned [218, 245, 260, 275, 288, 373, 380, 406]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2001 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 87 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2176 ms. Remains : 401/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-14
Product exploration explored 100000 steps with 18030 reset in 1903 ms.
Stack based approach found an accepted trace after 744 steps with 97 reset with depth 52 and stack size 52 in 18 ms.
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLCardinality-14 finished in 4358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:05:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:35] [INFO ] Invariant cache hit.
[2024-05-31 20:05:38] [INFO ] Implicit Places using invariants in 2064 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2073 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 89 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2253 ms. Remains : 400/409 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 2072 ms.
Product exploration explored 100000 steps with 0 reset in 2354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 703 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1194 ms. (33 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
[2024-05-31 20:05:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-31 20:05:44] [INFO ] Computed 200 invariants in 2 ms
[2024-05-31 20:05:44] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 456 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:05:47] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:05:48] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/800 variables, and 849 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5007 ms.
Refiners :[Domain max(s): 304/400 constraints, Positive P Invariants (semi-flows): 104/200 constraints, State Equation: 304/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 33/33 constraints]
After SMT, in 5542ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 380 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1258 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 226745 steps, run timeout after 3002 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 226745 steps, saw 208576 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-31 20:05:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:05:53] [INFO ] Invariant cache hit.
[2024-05-31 20:05:53] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 454 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:05:54] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:06:00] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:06:01] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 18/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 96/800 variables, 96/990 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/800 variables, 96/1086 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 96/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9347 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 78/78 constraints]
After SMT, in 9871ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 856 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 334 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 333 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:06:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:06:05] [INFO ] Invariant cache hit.
[2024-05-31 20:06:06] [INFO ] Implicit Places using invariants in 1458 ms returned []
Implicit Place search using SMT only with invariants took 1459 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:06:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:06:06] [INFO ] Invariant cache hit.
[2024-05-31 20:06:06] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49408ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51352 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.2 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 24 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-31 20:06:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 20:06:56] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 20:06:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 20:06:56] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 20:06:56] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 20:06:56] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 126 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 843 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:06:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-31 20:06:57] [INFO ] Computed 200 invariants in 1 ms
[2024-05-31 20:06:58] [INFO ] Implicit Places using invariants in 1356 ms returned []
Implicit Place search using SMT only with invariants took 1356 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:06:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:06:59] [INFO ] Invariant cache hit.
[2024-05-31 20:06:59] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49891ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49978ms
Finished structural reductions in LTL mode , in 1 iterations and 51453 ms. Remains : 400/400 places, 10200/10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 678 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1574 ms. (25 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
[2024-05-31 20:07:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:07:50] [INFO ] Invariant cache hit.
[2024-05-31 20:07:50] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 413 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:07:51] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-31 20:07:51] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-31 20:07:52] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-31 20:07:53] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:07:54] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:07:55] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:07:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:07:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
SMT process timed out in 5530ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 348 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1271 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-05-31 20:07:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:07:56] [INFO ] Invariant cache hit.
[2024-05-31 20:07:57] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:07:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:07:57] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:07:58] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-31 20:07:58] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-31 20:07:58] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:07:58] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-31 20:07:58] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-31 20:07:59] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-31 20:08:00] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:08:01] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:08:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:08:03] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-31 20:08:04] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:08:05] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:08:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:08:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:08:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10150 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 10559ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 288 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 335 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1545 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 265428 steps, run timeout after 3002 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 265428 steps, saw 243684 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-31 20:08:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:08:11] [INFO ] Invariant cache hit.
[2024-05-31 20:08:11] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 350 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:08:12] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:08:13] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-31 20:08:14] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:15] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:08:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-31 20:08:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:08:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 7/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/704 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 96/800 variables, 96/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1094 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 96/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/800 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10367 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 88/88 constraints]
After SMT, in 10793ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 285 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 336 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 334 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:08:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:08:23] [INFO ] Invariant cache hit.
[2024-05-31 20:08:24] [INFO ] Implicit Places using invariants in 1400 ms returned []
Implicit Place search using SMT only with invariants took 1403 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:08:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:08:24] [INFO ] Invariant cache hit.
[2024-05-31 20:08:25] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 48979ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50826 ms. Remains : 400/400 places, 10200/10200 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 600 edges and 400 vertex of which 16 are kept as prefixes of interest. Removing 384 places using SCC suffix rule.1 ms
Discarding 384 places :
Also discarding 9792 output transitions
Drop transitions (Output transitions of discarded places.) removed 9792 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 396 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 397 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 405 place count 10 transition count 10
Applied a total of 405 rules in 9 ms. Remains 10 /400 variables (removed 390) and now considering 10/10200 (removed 10190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-31 20:09:13] [INFO ] Computed 5 invariants in 2 ms
[2024-05-31 20:09:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 20:09:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 20:09:14] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 20:09:14] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 20:09:14] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 891 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2110 ms.
Product exploration explored 100000 steps with 0 reset in 2208 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 602 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:09:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-31 20:09:20] [INFO ] Computed 200 invariants in 5 ms
[2024-05-31 20:09:20] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 50403ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 50498ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51129 ms. Remains : 400/400 places, 10200/10200 transitions.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 109 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:10:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:10:11] [INFO ] Invariant cache hit.
[2024-05-31 20:10:12] [INFO ] Implicit Places using invariants in 1615 ms returned []
Implicit Place search using SMT only with invariants took 1619 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:10:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:10:13] [INFO ] Invariant cache hit.
[2024-05-31 20:10:13] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 10100 unsolved
SMT process timed out in 49351ms, After SMT, problems are : Problem set: 0 solved, 10100 unsolved
Search for dead transitions found 0 dead transitions in 49445ms
Finished structural reductions in LTL mode , in 1 iterations and 51194 ms. Remains : 400/400 places, 10200/10200 transitions.
Treatment of property Dekker-PT-100-LTLCardinality-15 finished in 327273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (G(p2)||F(G(p1)))))))'
Found a Lengthening insensitive property : Dekker-PT-100-LTLCardinality-15
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 409/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 231 ms. Remains 409 /409 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:11:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 409 cols
[2024-05-31 20:11:03] [INFO ] Computed 209 invariants in 5 ms
[2024-05-31 20:11:05] [INFO ] Implicit Places using invariants in 2068 ms returned [218, 245, 260, 275, 288, 373, 380, 403, 406]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2078 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/409 places, 10200/10200 transitions.
Applied a total of 0 rules in 219 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2528 ms. Remains : 400/409 places, 10200/10200 transitions.
Running random walk in product with property : Dekker-PT-100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 2154 ms.
Product exploration explored 100000 steps with 0 reset in 2214 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 648 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1243 ms. (32 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
[2024-05-31 20:11:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2024-05-31 20:11:11] [INFO ] Computed 200 invariants in 3 ms
[2024-05-31 20:11:11] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 437 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:11:12] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 20/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:11:17] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:11:17] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:11:17] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
SMT process timed out in 5546ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 339 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1263 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2024-05-31 20:11:18] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:11:18] [INFO ] Invariant cache hit.
[2024-05-31 20:11:18] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:19] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:11:19] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-31 20:11:19] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-31 20:11:19] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-31 20:11:19] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-31 20:11:20] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-31 20:11:21] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:11:22] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-31 20:11:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:24] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:11:25] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:26] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:11:27] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:11:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 96/800 variables, 96/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 96/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10015 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 81/81 constraints]
After SMT, in 10387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 262 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 363 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 400/400 places, 10200/10200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1164 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487729 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487729 steps, saw 446540 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-31 20:11:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:11:32] [INFO ] Invariant cache hit.
[2024-05-31 20:11:32] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/32 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 192/224 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 480/704 variables, 288/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 288/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 96/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 96/800 variables, 96/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 96/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 96/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/800 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 1100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/32 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 192/224 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 480/704 variables, 288/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 288/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 96/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:33] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-31 20:11:33] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:11:33] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-31 20:11:34] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-31 20:11:34] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-31 20:11:34] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-31 20:11:34] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-31 20:11:34] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-31 20:11:35] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/704 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:36] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:11:37] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:11:38] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/704 variables, 20/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 4 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:11:39] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:11:40] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/704 variables, 20/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:11:41] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:11:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 20/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/704 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 96/800 variables, 96/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/800 variables, 96/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/800 variables, 96/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/800 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 1182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9893 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 400/400 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 81/81 constraints]
After SMT, in 10256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 239 ms.
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 334 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 329 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-31 20:11:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:11:43] [INFO ] Invariant cache hit.
[2024-05-31 20:11:45] [INFO ] Implicit Places using invariants in 1408 ms returned []
Implicit Place search using SMT only with invariants took 1409 ms to find 0 implicit places.
Running 10100 sub problems to find dead transitions.
[2024-05-31 20:11:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2024-05-31 20:11:45] [INFO ] Invariant cache hit.
[2024-05-31 20:11:45] [INFO ] State equation strengthened by 100 read => feed constraints.
FORMULA Dekker-PT-100-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-100-LTLCardinality-05
FORMULA Dekker-PT-100-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-100-LTLCardinality-07
FORMULA Dekker-PT-100-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-100-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-100-LTLCardinality-15
BK_STOP 1717186411202
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Dekker-PT-100-LTLCardinality-00
ltl formula formula --ltl=/tmp/4077/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.060 real 0.440 user 0.410 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10210 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1006
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 1610 transitions, fanout: 134.167
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 600, Transitions per second: 80500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.1 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-01
ltl formula formula --ltl=/tmp/4077/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.900 real 0.420 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 700
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 1304 transitions, fanout: 144.889
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 130400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 36.6 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-02
ltl formula formula --ltl=/tmp/4077/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_2_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.930 real 0.400 user 0.410 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10217 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 199
pnml2lts-mc( 0/ 4): unique states count: 206
pnml2lts-mc( 0/ 4): unique transitions count: 803
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 323
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 217
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 217 states 1607 transitions, fanout: 7.406
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.040 sec minimum, 0.055 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3100, Transitions per second: 22957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.0 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-03
ltl formula formula --ltl=/tmp/4077/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_3_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.060 real 0.440 user 0.420 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 600
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 904 transitions, fanout: 100.444
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 90400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 38.2 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-04
ltl formula formula --ltl=/tmp/4077/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_4_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.160 real 0.440 user 0.410 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10228 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 806
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 11
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11 states 1110 transitions, fanout: 100.909
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 550, Transitions per second: 55500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 40.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-05
ltl formula formula --ltl=/tmp/4077/ltl_5_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_5_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.100 real 0.420 user 0.410 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~1524272 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~2972696 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~5763208 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~11755912 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 82789
pnml2lts-mc( 0/ 4): unique transitions count: 12411881
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2239417
pnml2lts-mc( 0/ 4): - claim success count: 82792
pnml2lts-mc( 0/ 4): - cum. max stack depth: 82792
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 82792 states 12411968 transitions, fanout: 149.917
pnml2lts-mc( 0/ 4): Total exploration time 24.310 sec (23.560 sec minimum, 23.912 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3406, Transitions per second: 510570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 118.7MB, 17.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 118.7MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-06
ltl formula formula --ltl=/tmp/4077/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.390 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 700
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 1004 transitions, fanout: 100.400
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 500, Transitions per second: 50200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 40.2 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-07
ltl formula formula --ltl=/tmp/4077/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.410 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10209 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~1459136 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~2971416 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~6735804 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 59050
pnml2lts-mc( 0/ 4): unique transitions count: 9669210
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1791470
pnml2lts-mc( 0/ 4): - claim success count: 59053
pnml2lts-mc( 0/ 4): - cum. max stack depth: 59053
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59053 states 9669305 transitions, fanout: 163.739
pnml2lts-mc( 0/ 4): Total exploration time 18.260 sec (17.750 sec minimum, 18.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3234, Transitions per second: 529535
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 103.2MB, 21.1 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 103.2MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-08
ltl formula formula --ltl=/tmp/4077/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.070 real 0.360 user 0.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10211 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 1106
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 1410 transitions, fanout: 100.714
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 70500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 38.0 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-09
ltl formula formula --ltl=/tmp/4077/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.380 user 0.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10210 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 2718
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 15
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15 states 3022 transitions, fanout: 201.467
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 750, Transitions per second: 151100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.8 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-10
ltl formula formula --ltl=/tmp/4077/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.440 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 25
pnml2lts-mc( 0/ 4): unique transitions count: 3045
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 37
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 3349 transitions, fanout: 119.607
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1400, Transitions per second: 167450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 35.0 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-11
ltl formula formula --ltl=/tmp/4077/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.430 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10208 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 1106
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 1410 transitions, fanout: 100.714
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 70500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.2 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-12
ltl formula formula --ltl=/tmp/4077/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.110 real 0.410 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 700
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 1004 transitions, fanout: 100.400
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 500, Transitions per second: 50200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-13
ltl formula formula --ltl=/tmp/4077/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.410 user 0.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10207 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 1312
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 1616 transitions, fanout: 101.000
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 80800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.8 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-14
ltl formula formula --ltl=/tmp/4077/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.460 user 0.260 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10210 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25
pnml2lts-mc( 0/ 4): unique states count: 39
pnml2lts-mc( 0/ 4): unique transitions count: 1214
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 1518 transitions, fanout: 36.143
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2100, Transitions per second: 75900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Dekker-PT-100-LTLCardinality-15
ltl formula formula --ltl=/tmp/4077/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 500 places, 10200 transitions and 80200 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.380 user 0.350 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4077/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4077/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4077/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4077/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 10220 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~1481632 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~2902648 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~6141564 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~12438060 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 85768
pnml2lts-mc( 0/ 4): unique transitions count: 14289208
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2825181
pnml2lts-mc( 0/ 4): - claim success count: 85771
pnml2lts-mc( 0/ 4): - cum. max stack depth: 85771
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 85771 states 14289388 transitions, fanout: 166.599
pnml2lts-mc( 0/ 4): Total exploration time 20.740 sec (20.200 sec minimum, 20.455 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4136, Transitions per second: 688977
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 120.6MB, 17.0 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 10437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 120.6MB (~256.0MB paged-in)
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="Dekker-PT-100"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-100, examination is LTLCardinality"
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-171631131900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;