About the Execution of LTSMin+red for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3978.063 | 407091.00 | 535416.00 | 1140.70 | [undef] | Cannot compute |
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.r492-smll-171636266300186.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 EisenbergMcGuire-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717229076637
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:04:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:04:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:04:39] [INFO ] Load time of PNML (sax parser for PT used): 512 ms
[2024-06-01 08:04:39] [INFO ] Transformed 712 places.
[2024-06-01 08:04:39] [INFO ] Transformed 2816 transitions.
[2024-06-01 08:04:39] [INFO ] Found NUPN structural information;
[2024-06-01 08:04:39] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 790 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 214 ms.
Support contains 162 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 686 transition count 2608
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 686 transition count 2608
Applied a total of 52 rules in 162 ms. Remains 686 /712 variables (removed 26) and now considering 2608/2816 (removed 208) transitions.
[2024-06-01 08:04:40] [INFO ] Flow matrix only has 1160 transitions (discarded 1448 similar events)
// Phase 1: matrix 1160 rows 686 cols
[2024-06-01 08:04:40] [INFO ] Computed 25 invariants in 36 ms
[2024-06-01 08:04:41] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-06-01 08:04:41] [INFO ] Flow matrix only has 1160 transitions (discarded 1448 similar events)
[2024-06-01 08:04:41] [INFO ] Invariant cache hit.
[2024-06-01 08:04:42] [INFO ] State equation strengthened by 494 read => feed constraints.
[2024-06-01 08:04:45] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned []
Implicit Place search using SMT with State Equation took 4612 ms to find 0 implicit places.
Running 2600 sub problems to find dead transitions.
[2024-06-01 08:04:45] [INFO ] Flow matrix only has 1160 transitions (discarded 1448 similar events)
[2024-06-01 08:04:45] [INFO ] Invariant cache hit.
[2024-06-01 08:04:45] [INFO ] State equation strengthened by 494 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2600 unsolved
SMT process timed out in 32555ms, After SMT, problems are : Problem set: 0 solved, 2600 unsolved
Search for dead transitions found 0 dead transitions in 32624ms
Starting structural reductions in LTL mode, iteration 1 : 686/712 places, 2608/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37449 ms. Remains : 686/712 places, 2608/2816 transitions.
Support contains 162 out of 686 places after structural reductions.
[2024-06-01 08:05:18] [INFO ] Flatten gal took : 511 ms
[2024-06-01 08:05:18] [INFO ] Flatten gal took : 165 ms
[2024-06-01 08:05:19] [INFO ] Input system was already deterministic with 2608 transitions.
RANDOM walk for 40000 steps (8 resets) in 4415 ms. (9 steps per ms) remains 94/124 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
[2024-06-01 08:05:21] [INFO ] Flow matrix only has 1160 transitions (discarded 1448 similar events)
[2024-06-01 08:05:21] [INFO ] Invariant cache hit.
[2024-06-01 08:05:21] [INFO ] State equation strengthened by 494 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 87 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (OVERLAPS) 552/686 variables, 16/17 constraints. Problems are: Problem set: 8 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 8/25 constraints. Problems are: Problem set: 8 solved, 86 unsolved
[2024-06-01 08:05:23] [INFO ] Deduced a trap composed of 3 places in 718 ms of which 77 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 3 places in 707 ms of which 11 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 3 places in 766 ms of which 12 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 3 places in 595 ms of which 7 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 6 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 5 ms to minimize.
SMT process timed out in 5405ms, After SMT, problems are : Problem set: 8 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 686 transition count 2607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 685 transition count 2607
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 2 place count 685 transition count 2427
Deduced a syphon composed of 180 places in 3 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 362 place count 505 transition count 2427
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 375 place count 492 transition count 2323
Iterating global reduction 2 with 13 rules applied. Total rules applied 388 place count 492 transition count 2323
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 498 place count 437 transition count 2268
Applied a total of 498 rules in 445 ms. Remains 437 /686 variables (removed 249) and now considering 2268/2608 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 437/686 places, 2268/2608 transitions.
RANDOM walk for 40000 steps (8 resets) in 825 ms. (48 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 85/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
Interrupted probabilistic random walk after 95220 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :21 out of 83
Probabilistic random walk after 95220 steps, saw 64404 distinct states, run finished after 3009 ms. (steps per millisecond=31 ) properties seen :21
[2024-06-01 08:05:31] [INFO ] Flow matrix only has 820 transitions (discarded 1448 similar events)
// Phase 1: matrix 820 rows 437 cols
[2024-06-01 08:05:31] [INFO ] Computed 25 invariants in 9 ms
[2024-06-01 08:05:31] [INFO ] State equation strengthened by 403 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 341/437 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 08:05:32] [INFO ] Deduced a trap composed of 3 places in 684 ms of which 6 ms to minimize.
[2024-06-01 08:05:33] [INFO ] Deduced a trap composed of 6 places in 539 ms of which 4 ms to minimize.
[2024-06-01 08:05:33] [INFO ] Deduced a trap composed of 58 places in 398 ms of which 3 ms to minimize.
[2024-06-01 08:05:34] [INFO ] Deduced a trap composed of 75 places in 403 ms of which 7 ms to minimize.
[2024-06-01 08:05:34] [INFO ] Deduced a trap composed of 6 places in 546 ms of which 6 ms to minimize.
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 3 places in 660 ms of which 7 ms to minimize.
[2024-06-01 08:05:36] [INFO ] Deduced a trap composed of 3 places in 588 ms of which 6 ms to minimize.
[2024-06-01 08:05:36] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 5 ms to minimize.
[2024-06-01 08:05:36] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 4 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 105 places in 664 ms of which 6 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 3 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 4 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 2 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:05:40] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:05:40] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 08:05:40] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:05:41] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:05:41] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:05:42] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 3 ms to minimize.
[2024-06-01 08:05:42] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 3 ms to minimize.
[2024-06-01 08:05:42] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:05:43] [INFO ] Deduced a trap composed of 98 places in 464 ms of which 5 ms to minimize.
[2024-06-01 08:05:43] [INFO ] Deduced a trap composed of 95 places in 363 ms of which 5 ms to minimize.
[2024-06-01 08:05:43] [INFO ] Deduced a trap composed of 93 places in 421 ms of which 8 ms to minimize.
[2024-06-01 08:05:44] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:05:44] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 820/1257 variables, 437/493 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 403/896 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/1257 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1257/1257 variables, and 896 constraints, problems are : Problem set: 0 solved, 62 unsolved in 24996 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 437/437 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 341/437 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem AtomicPropp104 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 8/25 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 31/56 constraints. Problems are: Problem set: 1 solved, 61 unsolved
[2024-06-01 08:05:57] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 4 ms to minimize.
[2024-06-01 08:05:58] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:05:58] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 23 ms to minimize.
[2024-06-01 08:05:58] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 4 ms to minimize.
[2024-06-01 08:05:59] [INFO ] Deduced a trap composed of 93 places in 572 ms of which 6 ms to minimize.
[2024-06-01 08:06:00] [INFO ] Deduced a trap composed of 82 places in 566 ms of which 5 ms to minimize.
[2024-06-01 08:06:00] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 4 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 2 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:06:02] [INFO ] Deduced a trap composed of 66 places in 694 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 11/67 constraints. Problems are: Problem set: 1 solved, 61 unsolved
[2024-06-01 08:06:03] [INFO ] Deduced a trap composed of 53 places in 622 ms of which 6 ms to minimize.
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 50 places in 600 ms of which 6 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 54 places in 608 ms of which 6 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 94 places in 561 ms of which 6 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 74 places in 593 ms of which 5 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 82 places in 576 ms of which 6 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 27 places in 643 ms of which 6 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 65 places in 693 ms of which 6 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:06:09] [INFO ] Deduced a trap composed of 64 places in 666 ms of which 7 ms to minimize.
[2024-06-01 08:06:09] [INFO ] Deduced a trap composed of 49 places in 565 ms of which 6 ms to minimize.
[2024-06-01 08:06:11] [INFO ] Deduced a trap composed of 69 places in 664 ms of which 7 ms to minimize.
[2024-06-01 08:06:11] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 5 ms to minimize.
[2024-06-01 08:06:12] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:06:12] [INFO ] Deduced a trap composed of 113 places in 574 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 15/82 constraints. Problems are: Problem set: 1 solved, 61 unsolved
[2024-06-01 08:06:13] [INFO ] Deduced a trap composed of 92 places in 619 ms of which 7 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 95 places in 638 ms of which 7 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 89 places in 642 ms of which 6 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 113 places in 726 ms of which 7 ms to minimize.
[2024-06-01 08:06:17] [INFO ] Deduced a trap composed of 92 places in 497 ms of which 6 ms to minimize.
[2024-06-01 08:06:18] [INFO ] Deduced a trap composed of 54 places in 670 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 6/88 constraints. Problems are: Problem set: 1 solved, 61 unsolved
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 80 places in 609 ms of which 6 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 77 places in 620 ms of which 6 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 110 places in 544 ms of which 7 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 101 places in 630 ms of which 7 ms to minimize.
[2024-06-01 08:06:22] [INFO ] Deduced a trap composed of 82 places in 632 ms of which 7 ms to minimize.
[2024-06-01 08:06:22] [INFO ] Deduced a trap composed of 75 places in 638 ms of which 7 ms to minimize.
[2024-06-01 08:06:23] [INFO ] Deduced a trap composed of 127 places in 624 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 7/95 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 820/1257 variables, 437/532 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1257 variables, 403/935 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1257 variables, 61/996 constraints. Problems are: Problem set: 1 solved, 61 unsolved
[2024-06-01 08:06:36] [INFO ] Deduced a trap composed of 114 places in 590 ms of which 6 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 57 places in 589 ms of which 5 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1257/1257 variables, and 1000 constraints, problems are : Problem set: 1 solved, 61 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 437/437 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 61/62 constraints, Known Traps: 74/74 constraints]
After SMT, in 70167ms problems are : Problem set: 1 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 2268/2268 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 437 transition count 2254
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 423 transition count 2254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 417 transition count 2206
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 417 transition count 2206
Applied a total of 40 rules in 267 ms. Remains 417 /437 variables (removed 20) and now considering 2206/2268 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 417/437 places, 2206/2268 transitions.
RANDOM walk for 40000 steps (8 resets) in 993 ms. (40 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 79182 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :2 out of 61
Probabilistic random walk after 79182 steps, saw 53983 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :2
[2024-06-01 08:06:45] [INFO ] Flow matrix only has 758 transitions (discarded 1448 similar events)
// Phase 1: matrix 758 rows 417 cols
[2024-06-01 08:06:45] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 08:06:45] [INFO ] State equation strengthened by 361 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 325/417 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:06:46] [INFO ] Deduced a trap composed of 3 places in 652 ms of which 7 ms to minimize.
[2024-06-01 08:06:47] [INFO ] Deduced a trap composed of 3 places in 528 ms of which 6 ms to minimize.
[2024-06-01 08:06:47] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 5 ms to minimize.
[2024-06-01 08:06:47] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 16 places in 451 ms of which 5 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 6 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 28 places in 537 ms of which 5 ms to minimize.
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 3 places in 537 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:06:51] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 7 ms to minimize.
[2024-06-01 08:06:51] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2024-06-01 08:06:51] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 2 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:06:53] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 3 ms to minimize.
[2024-06-01 08:06:53] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 4 ms to minimize.
[2024-06-01 08:06:53] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 68 places in 661 ms of which 7 ms to minimize.
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:06:55] [INFO ] Deduced a trap composed of 122 places in 617 ms of which 6 ms to minimize.
[2024-06-01 08:06:56] [INFO ] Deduced a trap composed of 84 places in 644 ms of which 6 ms to minimize.
[2024-06-01 08:06:56] [INFO ] Deduced a trap composed of 90 places in 665 ms of which 6 ms to minimize.
[2024-06-01 08:06:57] [INFO ] Deduced a trap composed of 109 places in 644 ms of which 6 ms to minimize.
[2024-06-01 08:06:58] [INFO ] Deduced a trap composed of 77 places in 588 ms of which 6 ms to minimize.
[2024-06-01 08:06:58] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 79 places in 651 ms of which 6 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 105 places in 613 ms of which 6 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 76 places in 609 ms of which 6 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 79 places in 642 ms of which 6 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 76 places in 590 ms of which 6 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 81 places in 576 ms of which 6 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 33 places in 618 ms of which 6 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 82 places in 671 ms of which 6 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 93 places in 605 ms of which 6 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 110 places in 613 ms of which 6 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 21 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 758/1175 variables, 417/484 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1175 variables, 361/845 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 3 ms to minimize.
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1175 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1175 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/1175 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 847 constraints, problems are : Problem set: 0 solved, 59 unsolved in 35319 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 417/417 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 325/417 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 44/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 88 places in 607 ms of which 6 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 3 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 74 places in 464 ms of which 5 ms to minimize.
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 95 places in 519 ms of which 5 ms to minimize.
[2024-06-01 08:07:27] [INFO ] Deduced a trap composed of 131 places in 532 ms of which 5 ms to minimize.
[2024-06-01 08:07:27] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 5 ms to minimize.
[2024-06-01 08:07:28] [INFO ] Deduced a trap composed of 124 places in 575 ms of which 6 ms to minimize.
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 74 places in 624 ms of which 6 ms to minimize.
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-06-01 08:07:30] [INFO ] Deduced a trap composed of 67 places in 679 ms of which 6 ms to minimize.
[2024-06-01 08:07:30] [INFO ] Deduced a trap composed of 80 places in 579 ms of which 6 ms to minimize.
[2024-06-01 08:07:31] [INFO ] Deduced a trap composed of 73 places in 572 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 65 places in 603 ms of which 6 ms to minimize.
[2024-06-01 08:07:33] [INFO ] Deduced a trap composed of 124 places in 536 ms of which 5 ms to minimize.
[2024-06-01 08:07:33] [INFO ] Deduced a trap composed of 92 places in 524 ms of which 7 ms to minimize.
[2024-06-01 08:07:34] [INFO ] Deduced a trap composed of 101 places in 485 ms of which 5 ms to minimize.
[2024-06-01 08:07:34] [INFO ] Deduced a trap composed of 79 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:07:36] [INFO ] Deduced a trap composed of 110 places in 537 ms of which 5 ms to minimize.
[2024-06-01 08:07:36] [INFO ] Deduced a trap composed of 128 places in 521 ms of which 5 ms to minimize.
[2024-06-01 08:07:37] [INFO ] Deduced a trap composed of 89 places in 526 ms of which 5 ms to minimize.
[2024-06-01 08:07:37] [INFO ] Deduced a trap composed of 116 places in 574 ms of which 6 ms to minimize.
[2024-06-01 08:07:38] [INFO ] Deduced a trap composed of 142 places in 581 ms of which 6 ms to minimize.
[2024-06-01 08:07:39] [INFO ] Deduced a trap composed of 76 places in 594 ms of which 6 ms to minimize.
[2024-06-01 08:07:39] [INFO ] Deduced a trap composed of 64 places in 606 ms of which 7 ms to minimize.
[2024-06-01 08:07:40] [INFO ] Deduced a trap composed of 53 places in 588 ms of which 6 ms to minimize.
[2024-06-01 08:07:41] [INFO ] Deduced a trap composed of 47 places in 592 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:42] [INFO ] Deduced a trap composed of 58 places in 606 ms of which 6 ms to minimize.
[2024-06-01 08:07:43] [INFO ] Deduced a trap composed of 100 places in 589 ms of which 6 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 90 places in 586 ms of which 5 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 94 places in 588 ms of which 6 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 111 places in 487 ms of which 5 ms to minimize.
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 79 places in 380 ms of which 5 ms to minimize.
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 113 places in 543 ms of which 6 ms to minimize.
[2024-06-01 08:07:47] [INFO ] Deduced a trap composed of 99 places in 532 ms of which 6 ms to minimize.
[2024-06-01 08:07:47] [INFO ] Deduced a trap composed of 91 places in 582 ms of which 6 ms to minimize.
[2024-06-01 08:07:48] [INFO ] Deduced a trap composed of 131 places in 577 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:50] [INFO ] Deduced a trap composed of 98 places in 601 ms of which 6 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 98 places in 587 ms of which 6 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 94 places in 499 ms of which 6 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 121 places in 517 ms of which 6 ms to minimize.
[2024-06-01 08:07:53] [INFO ] Deduced a trap composed of 86 places in 618 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:55] [INFO ] Deduced a trap composed of 94 places in 611 ms of which 6 ms to minimize.
[2024-06-01 08:07:56] [INFO ] Deduced a trap composed of 30 places in 526 ms of which 6 ms to minimize.
[2024-06-01 08:07:56] [INFO ] Deduced a trap composed of 105 places in 529 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:07:57] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-06-01 08:07:58] [INFO ] Deduced a trap composed of 89 places in 468 ms of which 5 ms to minimize.
[2024-06-01 08:07:59] [INFO ] Deduced a trap composed of 106 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:08:00] [INFO ] Deduced a trap composed of 101 places in 540 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:08:02] [INFO ] Deduced a trap composed of 92 places in 498 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:08:04] [INFO ] Deduced a trap composed of 81 places in 582 ms of which 6 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 88 places in 644 ms of which 7 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 98 places in 630 ms of which 6 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 75 places in 662 ms of which 7 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 48 places in 647 ms of which 6 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 108 places in 516 ms of which 5 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 100 places in 527 ms of which 5 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 100 places in 619 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (OVERLAPS) 758/1175 variables, 417/548 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1175 variables, 361/909 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1175 variables, 59/968 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 26 places in 513 ms of which 6 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 75 places in 616 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1175 variables, 4/972 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 08:08:32] [INFO ] Deduced a trap composed of 76 places in 597 ms of which 6 ms to minimize.
[2024-06-01 08:08:34] [INFO ] Deduced a trap composed of 79 places in 603 ms of which 6 ms to minimize.
[2024-06-01 08:08:34] [INFO ] Deduced a trap composed of 65 places in 592 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 975 constraints, problems are : Problem set: 0 solved, 59 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 417/417 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 113/113 constraints]
After SMT, in 110454ms problems are : Problem set: 0 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 2206/2206 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 416 transition count 2198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 416 transition count 2198
Applied a total of 2 rules in 206 ms. Remains 416 /417 variables (removed 1) and now considering 2198/2206 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 416/417 places, 2198/2206 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-01 08:08:36] [INFO ] Flatten gal took : 152 ms
[2024-06-01 08:08:36] [INFO ] Flatten gal took : 154 ms
[2024-06-01 08:08:36] [INFO ] Input system was already deterministic with 2608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 661 transition count 2408
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 661 transition count 2408
Applied a total of 50 rules in 67 ms. Remains 661 /686 variables (removed 25) and now considering 2408/2608 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 661/686 places, 2408/2608 transitions.
[2024-06-01 08:08:36] [INFO ] Flatten gal took : 71 ms
[2024-06-01 08:08:36] [INFO ] Flatten gal took : 77 ms
[2024-06-01 08:08:36] [INFO ] Input system was already deterministic with 2408 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 656 transition count 2368
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 656 transition count 2368
Applied a total of 60 rules in 66 ms. Remains 656 /686 variables (removed 30) and now considering 2368/2608 (removed 240) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 656/686 places, 2368/2608 transitions.
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 76 ms
[2024-06-01 08:08:37] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 658 transition count 2384
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 658 transition count 2384
Applied a total of 56 rules in 61 ms. Remains 658 /686 variables (removed 28) and now considering 2384/2608 (removed 224) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 658/686 places, 2384/2608 transitions.
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 81 ms
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 73 ms
[2024-06-01 08:08:37] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 686 transition count 2600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 678 transition count 2600
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 678 transition count 2401
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 479 transition count 2401
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 444 place count 449 transition count 2161
Iterating global reduction 2 with 30 rules applied. Total rules applied 474 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 586 place count 393 transition count 2105
Applied a total of 586 rules in 212 ms. Remains 393 /686 variables (removed 293) and now considering 2105/2608 (removed 503) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 213 ms. Remains : 393/686 places, 2105/2608 transitions.
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 58 ms
[2024-06-01 08:08:38] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 656 transition count 2368
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 656 transition count 2368
Applied a total of 60 rules in 33 ms. Remains 656 /686 variables (removed 30) and now considering 2368/2608 (removed 240) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 656/686 places, 2368/2608 transitions.
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 57 ms
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 65 ms
[2024-06-01 08:08:38] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 657 transition count 2376
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 657 transition count 2376
Applied a total of 58 rules in 30 ms. Remains 657 /686 variables (removed 29) and now considering 2376/2608 (removed 232) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 657/686 places, 2376/2608 transitions.
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 58 ms
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 67 ms
[2024-06-01 08:08:38] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 686 transition count 2600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 678 transition count 2600
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 678 transition count 2400
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 478 transition count 2400
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 446 place count 448 transition count 2160
Iterating global reduction 2 with 30 rules applied. Total rules applied 476 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 588 place count 392 transition count 2104
Applied a total of 588 rules in 151 ms. Remains 392 /686 variables (removed 294) and now considering 2104/2608 (removed 504) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 392/686 places, 2104/2608 transitions.
[2024-06-01 08:08:39] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:08:39] [INFO ] Flatten gal took : 58 ms
[2024-06-01 08:08:39] [INFO ] Input system was already deterministic with 2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 403137 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 403137 steps, saw 221024 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2024-06-01 08:08:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:08:42] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:08:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/104 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:08:42] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 248/352 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 30/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:08:42] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 216/700 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 216/700 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:08:43] [INFO ] Deduced a trap composed of 47 places in 511 ms of which 6 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2055 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 269 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 112 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 2803 ms. (142 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 08:08:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:08:46] [INFO ] Invariant cache hit.
[2024-06-01 08:08:46] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 08:08:46] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 08:08:46] [INFO ] After 224ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:08:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:08:46] [INFO ] After 54ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:08:46] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:08:46] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:08:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2024-06-01 08:08:46] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 08:08:47] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:08:47] [INFO ] After 82ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:08:47] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:08:47] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:08:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
TRAPS : Iteration 1
[2024-06-01 08:08:47] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:08:47] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 13539 ms. (295 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2955 ms. (1353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1706742 steps, run timeout after 12001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 1706742 steps, saw 628297 distinct states, run finished after 12001 ms. (steps per millisecond=142 ) properties seen :0
[2024-06-01 08:09:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:04] [INFO ] Invariant cache hit.
[2024-06-01 08:09:04] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:04] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 216/700 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 216/700 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:05] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1565ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 112 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 112 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:09:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:06] [INFO ] Invariant cache hit.
[2024-06-01 08:09:07] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-06-01 08:09:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:07] [INFO ] Invariant cache hit.
[2024-06-01 08:09:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:09:10] [INFO ] Implicit Places using invariants and state equation in 3375 ms returned []
Implicit Place search using SMT with State Equation took 4333 ms to find 0 implicit places.
[2024-06-01 08:09:10] [INFO ] Redundant transitions in 215 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:09:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:10] [INFO ] Invariant cache hit.
[2024-06-01 08:09:10] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:09:42] [INFO ] Deduced a trap composed of 3 places in 596 ms of which 6 ms to minimize.
SMT process timed out in 31683ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36412 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 1498 ms. (266 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 08:09:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:42] [INFO ] Invariant cache hit.
[2024-06-01 08:09:42] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 08:09:43] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 08:09:43] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:09:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:09:43] [INFO ] After 64ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:09:43] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:09:43] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:09:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2024-06-01 08:09:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 08:09:43] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:44] [INFO ] After 87ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 3 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
TRAPS : Iteration 1
[2024-06-01 08:09:44] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:44] [INFO ] After 1036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 455 steps (0 resets) in 10 ms. (41 steps per ms) remains 0/1 properties
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 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
Finished probabilistic random walk after 44404 steps, run visited all 1 properties in 521 ms. (steps per millisecond=85 )
Probabilistic random walk after 44404 steps, saw 30493 distinct states, run finished after 535 ms. (steps per millisecond=82 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 60 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:09:45] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 08:09:45] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-06-01 08:09:45] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:09:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-06-01 08:09:45] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:09:45] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-01 08:09:45] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:45] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 319 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 686 transition count 2600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 678 transition count 2600
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 678 transition count 2401
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 479 transition count 2401
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 442 place count 451 transition count 2177
Iterating global reduction 2 with 28 rules applied. Total rules applied 470 place count 451 transition count 2177
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 582 place count 395 transition count 2121
Applied a total of 582 rules in 170 ms. Remains 395 /686 variables (removed 291) and now considering 2121/2608 (removed 487) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 395/686 places, 2121/2608 transitions.
[2024-06-01 08:09:45] [INFO ] Flatten gal took : 80 ms
[2024-06-01 08:09:45] [INFO ] Flatten gal took : 90 ms
[2024-06-01 08:09:46] [INFO ] Input system was already deterministic with 2121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 657 transition count 2376
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 657 transition count 2376
Applied a total of 58 rules in 92 ms. Remains 657 /686 variables (removed 29) and now considering 2376/2608 (removed 232) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 657/686 places, 2376/2608 transitions.
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 79 ms
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 62 ms
[2024-06-01 08:09:46] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 658 transition count 2384
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 658 transition count 2384
Applied a total of 56 rules in 52 ms. Remains 658 /686 variables (removed 28) and now considering 2384/2608 (removed 224) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 658/686 places, 2384/2608 transitions.
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 67 ms
[2024-06-01 08:09:46] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 686 transition count 2600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 678 transition count 2600
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 678 transition count 2400
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 478 transition count 2400
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 445 place count 449 transition count 2168
Iterating global reduction 2 with 29 rules applied. Total rules applied 474 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 586 place count 393 transition count 2112
Applied a total of 586 rules in 162 ms. Remains 393 /686 variables (removed 293) and now considering 2112/2608 (removed 496) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 162 ms. Remains : 393/686 places, 2112/2608 transitions.
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 44 ms
[2024-06-01 08:09:46] [INFO ] Flatten gal took : 52 ms
[2024-06-01 08:09:47] [INFO ] Input system was already deterministic with 2112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 659 transition count 2392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 659 transition count 2392
Applied a total of 54 rules in 51 ms. Remains 659 /686 variables (removed 27) and now considering 2392/2608 (removed 216) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 659/686 places, 2392/2608 transitions.
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 52 ms
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:09:47] [INFO ] Input system was already deterministic with 2392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 658 transition count 2384
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 658 transition count 2384
Applied a total of 56 rules in 42 ms. Remains 658 /686 variables (removed 28) and now considering 2384/2608 (removed 224) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 658/686 places, 2384/2608 transitions.
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 64 ms
[2024-06-01 08:09:47] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 686 transition count 2600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 678 transition count 2600
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 678 transition count 2400
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 478 transition count 2400
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 446 place count 448 transition count 2160
Iterating global reduction 2 with 30 rules applied. Total rules applied 476 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 588 place count 392 transition count 2104
Applied a total of 588 rules in 149 ms. Remains 392 /686 variables (removed 294) and now considering 2104/2608 (removed 504) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 392/686 places, 2104/2608 transitions.
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 42 ms
[2024-06-01 08:09:47] [INFO ] Flatten gal took : 49 ms
[2024-06-01 08:09:48] [INFO ] Input system was already deterministic with 2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 418374 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 418374 steps, saw 227168 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 08:09:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:09:51] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 08:09:51] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:51] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:51] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:09:52] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 2 ms to minimize.
[2024-06-01 08:09:52] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 3 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 2 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 2 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 2 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 2 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 715 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2911 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 3664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 1639 ms. (243 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 08:09:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:09:55] [INFO ] Invariant cache hit.
[2024-06-01 08:09:55] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 08:09:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-06-01 08:09:55] [INFO ] After 238ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:09:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:09:55] [INFO ] After 78ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:09:55] [INFO ] After 153ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:09:55] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:09:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 08:09:56] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 08:09:56] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:56] [INFO ] After 90ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
TRAPS : Iteration 1
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
TRAPS : Iteration 2
[2024-06-01 08:09:57] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:09:57] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:09:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
TRAPS : Iteration 3
[2024-06-01 08:09:57] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-06-01 08:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 4
[2024-06-01 08:09:57] [INFO ] After 1170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:09:57] [INFO ] After 1633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 11519 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3061 ms. (1306 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1214532 steps, run timeout after 9001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 1214532 steps, saw 526584 distinct states, run finished after 9001 ms. (steps per millisecond=134 ) properties seen :0
[2024-06-01 08:10:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:10:10] [INFO ] Invariant cache hit.
[2024-06-01 08:10:10] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:10:10] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:10:10] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:10:12] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:10:12] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:10:12] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2413ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 114 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 115 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:10:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:10:13] [INFO ] Invariant cache hit.
[2024-06-01 08:10:13] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 08:10:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:10:13] [INFO ] Invariant cache hit.
[2024-06-01 08:10:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:10:17] [INFO ] Implicit Places using invariants and state equation in 3362 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
[2024-06-01 08:10:17] [INFO ] Redundant transitions in 248 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:10:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:10:17] [INFO ] Invariant cache hit.
[2024-06-01 08:10:17] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 5 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 3 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:10:40] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 71 places in 228 ms of which 3 ms to minimize.
[2024-06-01 08:10:41] [INFO ] Deduced a trap composed of 124 places in 268 ms of which 3 ms to minimize.
[2024-06-01 08:10:42] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 4 ms to minimize.
[2024-06-01 08:10:42] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2024-06-01 08:10:42] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:10:43] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:10:43] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:10:43] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 3 ms to minimize.
[2024-06-01 08:10:44] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:10:44] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 3 ms to minimize.
[2024-06-01 08:10:45] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 4 ms to minimize.
[2024-06-01 08:10:45] [INFO ] Deduced a trap composed of 74 places in 321 ms of which 3 ms to minimize.
[2024-06-01 08:10:46] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:10:48] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:10:49] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 47 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-06-01 08:10:55] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:10:56] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:10:56] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 4 ms to minimize.
[2024-06-01 08:10:56] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 2 ms to minimize.
[2024-06-01 08:10:57] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2024-06-01 08:10:57] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:10:57] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:10:58] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 3 ms to minimize.
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 60 places in 297 ms of which 3 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:11:00] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 3 ms to minimize.
[2024-06-01 08:11:01] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 4 ms to minimize.
[2024-06-01 08:11:02] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 08:11:02] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:11:03] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-06-01 08:11:03] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 4 ms to minimize.
[2024-06-01 08:11:04] [INFO ] Deduced a trap composed of 81 places in 310 ms of which 3 ms to minimize.
[2024-06-01 08:11:04] [INFO ] Deduced a trap composed of 89 places in 328 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:11:11] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2024-06-01 08:11:18] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 69 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 44/44 constraints]
After SMT, in 61742ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66395 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 1365 ms. (292 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2024-06-01 08:11:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:11:19] [INFO ] Invariant cache hit.
[2024-06-01 08:11:19] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 08:11:19] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-06-01 08:11:20] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 08:11:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:11:20] [INFO ] After 59ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:11:20] [INFO ] After 113ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:11:20] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:11:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 08:11:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2024-06-01 08:11:20] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:11:20] [INFO ] After 62ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:11:20] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 1
[2024-06-01 08:11:20] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 2
[2024-06-01 08:11:20] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:11:21] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
TRAPS : Iteration 3
[2024-06-01 08:11:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 4
[2024-06-01 08:11:21] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:11:21] [INFO ] After 1073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 2114 steps (0 resets) in 10 ms. (192 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 93886 steps, run visited all 1 properties in 680 ms. (steps per millisecond=138 )
Probabilistic random walk after 93886 steps, saw 60395 distinct states, run finished after 681 ms. (steps per millisecond=137 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 37 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:11:22] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 08:11:22] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 08:11:22] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:11:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 08:11:22] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:11:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:11:22] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:11:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-06-01 08:11:22] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:11:22] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 408 ms.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 657 transition count 2376
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 657 transition count 2376
Applied a total of 58 rules in 31 ms. Remains 657 /686 variables (removed 29) and now considering 2376/2608 (removed 232) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 657/686 places, 2376/2608 transitions.
[2024-06-01 08:11:22] [INFO ] Flatten gal took : 61 ms
[2024-06-01 08:11:22] [INFO ] Flatten gal took : 71 ms
[2024-06-01 08:11:22] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 686/686 places, 2608/2608 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 660 transition count 2400
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 660 transition count 2400
Applied a total of 52 rules in 29 ms. Remains 660 /686 variables (removed 26) and now considering 2400/2608 (removed 208) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 660/686 places, 2400/2608 transitions.
[2024-06-01 08:11:22] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:11:22] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:11:23] [INFO ] Input system was already deterministic with 2400 transitions.
[2024-06-01 08:11:23] [INFO ] Flatten gal took : 67 ms
[2024-06-01 08:11:23] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:11:23] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-06-01 08:11:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 686 places, 2608 transitions and 12608 arcs took 30 ms.
Total runtime 404154 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2024-11
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLFireability-2023-15
BK_STOP 1717229483728
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1509/ctl_0_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1509/ctl_1_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1509/ctl_2_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1509/ctl_3_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1509/ctl_4_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1509/ctl_5_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1509/ctl_6_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1509/ctl_7_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1509/ctl_8_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1509/ctl_9_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1509/ctl_10_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1509/ctl_11_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1509/ctl_12_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1509/ctl_13_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1509/ctl_14_
ctl formula name EisenbergMcGuire-PT-08-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1509/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="CTLFireability"
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 EisenbergMcGuire-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266300186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;