Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200490.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J30, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717261174109

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:59:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:59:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:59:36] [INFO ] Load time of PNML (sax parser for PT used): 524 ms
[2024-06-01 16:59:36] [INFO ] Transformed 664 places.
[2024-06-01 16:59:36] [INFO ] Transformed 12050 transitions.
[2024-06-01 16:59:36] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 709 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 80 ms.
[2024-06-01 16:59:36] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 16:59:36] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:59:36] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:59:36] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:59:36] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 628 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 54 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 16:59:36] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 16:59:36] [INFO ] Computed 92 invariants in 104 ms
[2024-06-01 16:59:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20134 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 55495ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 55548ms
[2024-06-01 17:00:32] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:32] [INFO ] Invariant cache hit.
[2024-06-01 17:00:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 17:00:32] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:32] [INFO ] Invariant cache hit.
[2024-06-01 17:00:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:00:33] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:00:33] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:33] [INFO ] Invariant cache hit.
[2024-06-01 17:00:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
[2024-06-01 17:01:29] [INFO ] Deduced a trap composed of 19 places in 482 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 72 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 76768ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 76813ms
Finished structural reductions in LTL mode , in 1 iterations and 133577 ms. Remains : 664/664 places, 1940/1940 transitions.
Support contains 628 out of 664 places after structural reductions.
[2024-06-01 17:01:50] [INFO ] Flatten gal took : 376 ms
[2024-06-01 17:01:51] [INFO ] Flatten gal took : 189 ms
[2024-06-01 17:01:52] [INFO ] Input system was already deterministic with 1940 transitions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (2241 resets) in 9154 ms. (4 steps per ms) remains 71/77 properties
BEST_FIRST walk for 4004 steps (40 resets) in 188 ms. (21 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 317 ms. (12 steps per ms) remains 62/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 292 ms. (13 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 475 ms. (8 steps per ms) remains 59/62 properties
BEST_FIRST walk for 4003 steps (40 resets) in 77 ms. (51 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 96 ms. (41 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (39 resets) in 58 ms. (67 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 80 ms. (49 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 81 ms. (48 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 128 ms. (31 steps per ms) remains 51/59 properties
BEST_FIRST walk for 4003 steps (40 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (40 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 145 ms. (27 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
[2024-06-01 17:01:55] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:55] [INFO ] Invariant cache hit.
[2024-06-01 17:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 152/613 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 5 (OVERLAPS) 51/664 variables, 27/92 constraints. Problems are: Problem set: 27 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 27 solved, 5 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 7 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 28 solved, 4 unsolved
[2024-06-01 17:02:00] [INFO ] Deduced a trap composed of 327 places in 513 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2595 variables, 1/758 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 0/758 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2595 variables, 0/758 constraints. Problems are: Problem set: 28 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 758 constraints, problems are : Problem set: 28 solved, 4 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 28 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 129/146 variables, 7/7 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/312 variables, 27/34 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/34 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 260/572 variables, 26/60 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/60 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 89/661 variables, 29/89 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 1/90 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/90 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/664 variables, 3/93 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/93 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1931/2595 variables, 664/757 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2595 variables, 1/758 constraints. Problems are: Problem set: 28 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2595 variables, 2/760 constraints. Problems are: Problem set: 28 solved, 4 unsolved
[2024-06-01 17:02:05] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2595 variables, 1/761 constraints. Problems are: Problem set: 28 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 761 constraints, problems are : Problem set: 28 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 11973ms problems are : Problem set: 28 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 654 transition count 1906
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 78 place count 620 transition count 1906
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 78 place count 620 transition count 1872
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1869
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 583 transition count 1868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1868
Applied a total of 154 rules in 387 ms. Remains 582 /664 variables (removed 82) and now considering 1868/1940 (removed 72) transitions.
Running 1857 sub problems to find dead transitions.
[2024-06-01 17:02:08] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
// Phase 1: matrix 1859 rows 582 cols
[2024-06-01 17:02:08] [INFO ] Computed 82 invariants in 130 ms
[2024-06-01 17:02:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2441 variables, and 72 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 17:03:00] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 1 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 133 places in 356 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2441 variables, and 74 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/857 constraints, Known Traps: 2/2 constraints]
After SMT, in 56569ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 56589ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56982 ms. Remains : 582/664 places, 1868/1940 transitions.
RANDOM walk for 40000 steps (2691 resets) in 962 ms. (41 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (356 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (361 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (94 resets) in 104 ms. (380 steps per ms) remains 2/3 properties
[2024-06-01 17:03:05] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
[2024-06-01 17:03:05] [INFO ] Invariant cache hit.
[2024-06-01 17:03:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/242 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 270/512 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/579 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/582 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1859/2441 variables, 582/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2441 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2441 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2441 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2441/2441 variables, and 665 constraints, problems are : Problem set: 0 solved, 2 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 582/582 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/242 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 270/512 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 67/579 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/582 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1859/2441 variables, 582/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2441 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2441 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:03:07] [INFO ] Deduced a trap composed of 281 places in 559 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2441 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2441 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2441 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2441/2441 variables, and 667 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3277 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 582/582 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4303ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 116 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1868/1868 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 582 transition count 1866
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 580 transition count 1866
Applied a total of 4 rules in 100 ms. Remains 580 /582 variables (removed 2) and now considering 1866/1868 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 580/582 places, 1866/1868 transitions.
RANDOM walk for 40000 steps (2864 resets) in 811 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245743 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245743 steps, saw 40709 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 17:03:12] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-06-01 17:03:13] [INFO ] Computed 82 invariants in 23 ms
[2024-06-01 17:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:03:15] [INFO ] Deduced a trap composed of 270 places in 518 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 72 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 67 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 17:03:15] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:15] [INFO ] Invariant cache hit.
[2024-06-01 17:03:16] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-06-01 17:03:16] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:16] [INFO ] Invariant cache hit.
[2024-06-01 17:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:03:22] [INFO ] Implicit Places using invariants and state equation in 6188 ms returned []
Implicit Place search using SMT with State Equation took 7119 ms to find 0 implicit places.
[2024-06-01 17:03:23] [INFO ] Redundant transitions in 156 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:03:23] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:23] [INFO ] Invariant cache hit.
[2024-06-01 17:03:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1865 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 2 ms to minimize.
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 0/74 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 4 (OVERLAPS) 10/580 variables, 10/84 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/2437 variables, and 84 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 76482ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 76505ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1251/1866 transitions.
Applied a total of 0 rules in 37 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:04:39] [INFO ] Redundant transitions in 70 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83977 ms. Remains : 580/580 places, 1251/1866 transitions.
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:04:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 17:04:40] [INFO ] Flatten gal took : 170 ms
[2024-06-01 17:04:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:04:40] [INFO ] Flatten gal took : 141 ms
[2024-06-01 17:04:40] [INFO ] Input system was already deterministic with 1940 transitions.
Support contains 522 out of 664 places (down from 551) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 159 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-06-01 17:04:41] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-06-01 17:04:41] [INFO ] Computed 82 invariants in 46 ms
[2024-06-01 17:04:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-06-01 17:05:33] [INFO ] Deduced a trap composed of 132 places in 488 ms of which 4 ms to minimize.
[2024-06-01 17:05:33] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 74 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 2/2 constraints]
After SMT, in 56029ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 56045ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56210 ms. Remains : 583/664 places, 1869/1940 transitions.
[2024-06-01 17:05:37] [INFO ] Flatten gal took : 90 ms
[2024-06-01 17:05:37] [INFO ] Flatten gal took : 102 ms
[2024-06-01 17:05:37] [INFO ] Input system was already deterministic with 1869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 18 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:05:37] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-06-01 17:05:37] [INFO ] Computed 82 invariants in 40 ms
[2024-06-01 17:05:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 57081ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 57100ms
Finished structural reductions in LTL mode , in 1 iterations and 57122 ms. Remains : 654/664 places, 1940/1940 transitions.
[2024-06-01 17:06:34] [INFO ] Flatten gal took : 95 ms
[2024-06-01 17:06:35] [INFO ] Flatten gal took : 116 ms
[2024-06-01 17:06:35] [INFO ] Input system was already deterministic with 1940 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 38 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:06:35] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:06:35] [INFO ] Computed 82 invariants in 28 ms
[2024-06-01 17:06:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 56972ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 56990ms
Finished structural reductions in LTL mode , in 1 iterations and 57032 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-06-01 17:07:32] [INFO ] Flatten gal took : 83 ms
[2024-06-01 17:07:32] [INFO ] Flatten gal took : 91 ms
[2024-06-01 17:07:32] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1867
Applied a total of 146 rules in 168 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-06-01 17:07:32] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-06-01 17:07:32] [INFO ] Computed 82 invariants in 50 ms
[2024-06-01 17:07:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 17:08:10] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2024-06-01 17:08:25] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 56166ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 56182ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56356 ms. Remains : 581/664 places, 1867/1940 transitions.
[2024-06-01 17:08:29] [INFO ] Flatten gal took : 90 ms
[2024-06-01 17:08:29] [INFO ] Flatten gal took : 79 ms
[2024-06-01 17:08:29] [INFO ] Input system was already deterministic with 1867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 40 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:08:29] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:08:29] [INFO ] Computed 82 invariants in 45 ms
[2024-06-01 17:08:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 56456ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 56473ms
Finished structural reductions in LTL mode , in 1 iterations and 56518 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-06-01 17:09:25] [INFO ] Flatten gal took : 89 ms
[2024-06-01 17:09:26] [INFO ] Flatten gal took : 109 ms
[2024-06-01 17:09:26] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1866
Applied a total of 148 rules in 110 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:09:26] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-06-01 17:09:26] [INFO ] Computed 82 invariants in 39 ms
[2024-06-01 17:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 87 places in 351 ms of which 2 ms to minimize.
[2024-06-01 17:10:10] [INFO ] Deduced a trap composed of 283 places in 542 ms of which 4 ms to minimize.
[2024-06-01 17:10:11] [INFO ] Deduced a trap composed of 265 places in 403 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 56368ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 56385ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56499 ms. Remains : 580/664 places, 1866/1940 transitions.
[2024-06-01 17:10:22] [INFO ] Flatten gal took : 73 ms
[2024-06-01 17:10:22] [INFO ] Flatten gal took : 78 ms
[2024-06-01 17:10:23] [INFO ] Input system was already deterministic with 1866 transitions.
RANDOM walk for 40000 steps (2907 resets) in 668 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (366 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274879 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274879 steps, saw 45157 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-01 17:10:26] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:10:26] [INFO ] Invariant cache hit.
[2024-06-01 17:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 113 places in 505 ms of which 4 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 280 places in 441 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:10:29] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:10:29] [INFO ] Invariant cache hit.
[2024-06-01 17:10:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 4.0)
(s97 0.0)
(s98 4.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 4.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 8.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 4.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 4.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s396 4.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 4.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 4.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 18 places in 429 ms of which 3 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 95 places in 475 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 56041ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 56065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56117 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 400000 steps (29022 resets) in 6771 ms. (59 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 17:11:27] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:11:27] [INFO ] Invariant cache hit.
[2024-06-01 17:11:27] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2024-06-01 17:11:27] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2024-06-01 17:11:28] [INFO ] After 531ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 17:11:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:11:28] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:11:28] [INFO ] After 134ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:11:28] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:11:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-06-01 17:11:28] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 29 ms returned sat
[2024-06-01 17:11:29] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 17:11:29] [INFO ] After 280ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:11:29] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:11:29] [INFO ] After 1499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (290508 resets) in 47930 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35600 resets) in 8921 ms. (448 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3718704 steps, run timeout after 42001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 3718704 steps, saw 632348 distinct states, run finished after 42001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 17:12:26] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:12:26] [INFO ] Invariant cache hit.
[2024-06-01 17:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:12:28] [INFO ] Deduced a trap composed of 113 places in 490 ms of which 4 ms to minimize.
[2024-06-01 17:12:29] [INFO ] Deduced a trap composed of 280 places in 480 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2200 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 83 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 56 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 17:12:29] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:12:29] [INFO ] Invariant cache hit.
[2024-06-01 17:12:30] [INFO ] Implicit Places using invariants in 845 ms returned []
[2024-06-01 17:12:30] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:12:30] [INFO ] Invariant cache hit.
[2024-06-01 17:12:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:12:38] [INFO ] Implicit Places using invariants and state equation in 7528 ms returned []
Implicit Place search using SMT with State Equation took 8374 ms to find 0 implicit places.
[2024-06-01 17:12:38] [INFO ] Redundant transitions in 73 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:12:38] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:12:38] [INFO ] Invariant cache hit.
[2024-06-01 17:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1541 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-06-01 17:13:25] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 283 places in 481 ms of which 4 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 104 places in 455 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 75748ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 75769ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1251/1866 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:13:54] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84334 ms. Remains : 580/580 places, 1251/1866 transitions.
RANDOM walk for 4000000 steps (290951 resets) in 26361 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35599 resets) in 5784 ms. (691 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2728705 steps, run timeout after 24001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 2728705 steps, saw 458069 distinct states, run finished after 24001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 17:14:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-06-01 17:14:26] [INFO ] Computed 82 invariants in 19 ms
[2024-06-01 17:14:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1242/1821 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1821 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1821 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1822 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 220 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 238 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 220 places in 305 ms of which 5 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 208 places in 297 ms of which 6 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 208 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 216 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 230 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 224 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 208 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:14:36] [INFO ] Deduced a trap composed of 238 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:14:36] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:14:36] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:14:37] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:14:37] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:14:37] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:14:37] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 3 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 3 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 3 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 232 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 236 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 4 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 2 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 3 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 236 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 3 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 222 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 232 places in 206 ms of which 2 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 240 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 226 places in 203 ms of which 2 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 234 places in 196 ms of which 2 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 238 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 4 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 4 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 7 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 232 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 4 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 228 places in 309 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 222 places in 274 ms of which 5 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 4 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 232 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 5 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 4 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 236 places in 305 ms of which 4 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 4 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 2 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 234 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 2 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 4 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 232 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 226 places in 304 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 232 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 3 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 4 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 244 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 228 places in 204 ms of which 2 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:15:20] [INFO ] Deduced a trap composed of 238 places in 320 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:20] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:15:20] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:15:21] [INFO ] Deduced a trap composed of 216 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:15:21] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 208 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 232 places in 312 ms of which 4 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 232 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:15:27] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:15:27] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 236 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 236 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:15:30] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:30] [INFO ] Deduced a trap composed of 226 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 220 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:15:36] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:15:36] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:15:37] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:15:37] [INFO ] Deduced a trap composed of 220 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 234 places in 348 ms of which 4 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 224 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 220 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 232 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 5 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:15:41] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:15:41] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 3 ms to minimize.
[2024-06-01 17:15:41] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:15:41] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:15:42] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 4 ms to minimize.
SMT process timed out in 75721ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 36 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:15:42] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:15:42] [INFO ] Invariant cache hit.
[2024-06-01 17:15:43] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 17:15:43] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:15:43] [INFO ] Invariant cache hit.
[2024-06-01 17:15:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:15:50] [INFO ] Implicit Places using invariants and state equation in 7403 ms returned []
Implicit Place search using SMT with State Equation took 8182 ms to find 0 implicit places.
[2024-06-01 17:15:50] [INFO ] Redundant transitions in 45 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:15:50] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:15:50] [INFO ] Invariant cache hit.
[2024-06-01 17:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 156 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 240 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 236 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 226 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 226 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:10] [INFO ] Deduced a trap composed of 146 places in 253 ms of which 3 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 152 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 229 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 146 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 146 places in 213 ms of which 4 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 141 places in 215 ms of which 4 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 181 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 157 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 3 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 3 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 4 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:28] [INFO ] Deduced a trap composed of 136 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:16:28] [INFO ] Deduced a trap composed of 121 places in 247 ms of which 5 ms to minimize.
[2024-06-01 17:16:28] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:16:28] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 106 places in 271 ms of which 4 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 131 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 79 places in 231 ms of which 4 ms to minimize.
[2024-06-01 17:16:29] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 121 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 117 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 116 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 3 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 142 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:16:32] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:16:32] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:16:32] [INFO ] Deduced a trap composed of 116 places in 244 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2024-06-01 17:16:35] [INFO ] Deduced a trap composed of 175 places in 363 ms of which 4 ms to minimize.
[2024-06-01 17:16:35] [INFO ] Deduced a trap composed of 151 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 111 places in 311 ms of which 5 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 166 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 161 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:16:37] [INFO ] Deduced a trap composed of 140 places in 295 ms of which 6 ms to minimize.
[2024-06-01 17:16:37] [INFO ] Deduced a trap composed of 152 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:16:37] [INFO ] Deduced a trap composed of 121 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 156 places in 354 ms of which 4 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 136 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 160 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 156 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 160 places in 296 ms of which 3 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 155 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 151 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 146 places in 337 ms of which 4 ms to minimize.
[2024-06-01 17:16:41] [INFO ] Deduced a trap composed of 150 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:16:41] [INFO ] Deduced a trap composed of 146 places in 293 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 116 places in 343 ms of which 4 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 131 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 156 places in 318 ms of which 3 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 116 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 121 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 130 places in 260 ms of which 3 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 116 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 146 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 130 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 126 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 131 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 132 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 106 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 111 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 161 places in 354 ms of which 3 ms to minimize.
[2024-06-01 17:16:49] [INFO ] Deduced a trap composed of 132 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:16:49] [INFO ] Deduced a trap composed of 135 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:16:49] [INFO ] Deduced a trap composed of 121 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:16:50] [INFO ] Deduced a trap composed of 131 places in 325 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 222 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 182 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 161 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 171 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 171 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 176 places in 263 ms of which 5 ms to minimize.
SMT process timed out in 64879ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 64897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73165 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 400000 steps (29090 resets) in 3473 ms. (115 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 17:16:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:16:56] [INFO ] Invariant cache hit.
[2024-06-01 17:16:56] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-06-01 17:16:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 31 ms returned sat
[2024-06-01 17:16:56] [INFO ] After 350ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 17:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:16:56] [INFO ] After 59ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:16:57] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:16:57] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:16:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:16:57] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 44 ms returned sat
[2024-06-01 17:16:57] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 17:16:57] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:16:58] [INFO ] Deduced a trap composed of 230 places in 334 ms of which 3 ms to minimize.
[2024-06-01 17:16:58] [INFO ] Deduced a trap composed of 235 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:16:59] [INFO ] Deduced a trap composed of 227 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:16:59] [INFO ] Deduced a trap composed of 236 places in 366 ms of which 4 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 245 places in 378 ms of which 4 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 235 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 226 places in 363 ms of which 4 ms to minimize.
[2024-06-01 17:17:01] [INFO ] Deduced a trap composed of 235 places in 383 ms of which 4 ms to minimize.
[2024-06-01 17:17:01] [INFO ] Deduced a trap composed of 229 places in 351 ms of which 4 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 238 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 237 places in 388 ms of which 4 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 233 places in 352 ms of which 4 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 243 places in 370 ms of which 4 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 234 places in 355 ms of which 4 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 230 places in 355 ms of which 4 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Deduced a trap composed of 222 places in 349 ms of which 3 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Deduced a trap composed of 231 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:17:06] [INFO ] Deduced a trap composed of 225 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:17:06] [INFO ] Deduced a trap composed of 223 places in 385 ms of which 4 ms to minimize.
[2024-06-01 17:17:07] [INFO ] Deduced a trap composed of 243 places in 384 ms of which 4 ms to minimize.
[2024-06-01 17:17:07] [INFO ] Deduced a trap composed of 236 places in 386 ms of which 4 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 231 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 239 places in 363 ms of which 4 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 235 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 239 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 225 places in 377 ms of which 4 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 244 places in 378 ms of which 4 ms to minimize.
[2024-06-01 17:17:11] [INFO ] Deduced a trap composed of 229 places in 385 ms of which 4 ms to minimize.
[2024-06-01 17:17:12] [INFO ] Deduced a trap composed of 229 places in 385 ms of which 4 ms to minimize.
[2024-06-01 17:17:12] [INFO ] Deduced a trap composed of 232 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:17:13] [INFO ] Deduced a trap composed of 236 places in 375 ms of which 3 ms to minimize.
[2024-06-01 17:17:13] [INFO ] Deduced a trap composed of 236 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:17:14] [INFO ] Deduced a trap composed of 232 places in 364 ms of which 5 ms to minimize.
[2024-06-01 17:17:14] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:17:14] [INFO ] Deduced a trap composed of 239 places in 352 ms of which 4 ms to minimize.
[2024-06-01 17:17:15] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:17:15] [INFO ] Deduced a trap composed of 226 places in 354 ms of which 4 ms to minimize.
[2024-06-01 17:17:16] [INFO ] Deduced a trap composed of 226 places in 356 ms of which 4 ms to minimize.
[2024-06-01 17:17:17] [INFO ] Deduced a trap composed of 234 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:17:17] [INFO ] Deduced a trap composed of 232 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:17:18] [INFO ] Deduced a trap composed of 234 places in 378 ms of which 3 ms to minimize.
[2024-06-01 17:17:18] [INFO ] Deduced a trap composed of 239 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:17:19] [INFO ] Deduced a trap composed of 232 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:17:20] [INFO ] Deduced a trap composed of 232 places in 367 ms of which 4 ms to minimize.
[2024-06-01 17:17:21] [INFO ] Deduced a trap composed of 224 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:17:21] [INFO ] Deduced a trap composed of 236 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:17:23] [INFO ] Deduced a trap composed of 236 places in 373 ms of which 4 ms to minimize.
[2024-06-01 17:17:24] [INFO ] Deduced a trap composed of 233 places in 367 ms of which 4 ms to minimize.
[2024-06-01 17:17:24] [INFO ] Deduced a trap composed of 226 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:17:25] [INFO ] Deduced a trap composed of 236 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:17:25] [INFO ] Deduced a trap composed of 236 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:17:26] [INFO ] Deduced a trap composed of 234 places in 420 ms of which 6 ms to minimize.
[2024-06-01 17:17:26] [INFO ] Deduced a trap composed of 229 places in 370 ms of which 4 ms to minimize.
[2024-06-01 17:17:26] [INFO ] Deduced a trap composed of 243 places in 374 ms of which 3 ms to minimize.
[2024-06-01 17:17:28] [INFO ] Deduced a trap composed of 231 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:17:29] [INFO ] Deduced a trap composed of 236 places in 386 ms of which 3 ms to minimize.
[2024-06-01 17:17:29] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 4 ms to minimize.
[2024-06-01 17:17:30] [INFO ] Deduced a trap composed of 222 places in 409 ms of which 4 ms to minimize.
[2024-06-01 17:17:30] [INFO ] Deduced a trap composed of 233 places in 361 ms of which 3 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 234 places in 383 ms of which 4 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 3 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 226 places in 302 ms of which 3 ms to minimize.
[2024-06-01 17:17:34] [INFO ] Deduced a trap composed of 227 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:17:34] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:17:34] [INFO ] Deduced a trap composed of 220 places in 326 ms of which 3 ms to minimize.
[2024-06-01 17:17:36] [INFO ] Deduced a trap composed of 230 places in 379 ms of which 3 ms to minimize.
[2024-06-01 17:17:37] [INFO ] Deduced a trap composed of 240 places in 384 ms of which 3 ms to minimize.
[2024-06-01 17:17:37] [INFO ] Deduced a trap composed of 242 places in 370 ms of which 4 ms to minimize.
[2024-06-01 17:17:38] [INFO ] Deduced a trap composed of 241 places in 367 ms of which 4 ms to minimize.
[2024-06-01 17:17:38] [INFO ] Deduced a trap composed of 230 places in 376 ms of which 4 ms to minimize.
[2024-06-01 17:17:39] [INFO ] Deduced a trap composed of 238 places in 351 ms of which 3 ms to minimize.
[2024-06-01 17:17:39] [INFO ] Deduced a trap composed of 224 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:17:41] [INFO ] Deduced a trap composed of 231 places in 404 ms of which 4 ms to minimize.
[2024-06-01 17:17:42] [INFO ] Deduced a trap composed of 234 places in 378 ms of which 4 ms to minimize.
[2024-06-01 17:17:43] [INFO ] Deduced a trap composed of 233 places in 385 ms of which 4 ms to minimize.
[2024-06-01 17:17:45] [INFO ] Deduced a trap composed of 231 places in 384 ms of which 4 ms to minimize.
[2024-06-01 17:17:48] [INFO ] Deduced a trap composed of 238 places in 378 ms of which 4 ms to minimize.
[2024-06-01 17:17:48] [INFO ] Deduced a trap composed of 228 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:17:49] [INFO ] Deduced a trap composed of 236 places in 375 ms of which 4 ms to minimize.
[2024-06-01 17:17:49] [INFO ] Deduced a trap composed of 228 places in 354 ms of which 4 ms to minimize.
[2024-06-01 17:17:51] [INFO ] Deduced a trap composed of 237 places in 403 ms of which 5 ms to minimize.
[2024-06-01 17:17:51] [INFO ] Deduced a trap composed of 241 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:17:52] [INFO ] Deduced a trap composed of 223 places in 367 ms of which 4 ms to minimize.
[2024-06-01 17:17:54] [INFO ] Deduced a trap composed of 228 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:17:54] [INFO ] Deduced a trap composed of 230 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:17:55] [INFO ] Deduced a trap composed of 230 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:17:56] [INFO ] Deduced a trap composed of 234 places in 376 ms of which 4 ms to minimize.
[2024-06-01 17:17:56] [INFO ] Deduced a trap composed of 231 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:17:57] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:18:03] [INFO ] Deduced a trap composed of 226 places in 366 ms of which 4 ms to minimize.
[2024-06-01 17:18:04] [INFO ] Deduced a trap composed of 231 places in 356 ms of which 3 ms to minimize.
[2024-06-01 17:18:24] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 86507 ms
TRAPS : Iteration 1
[2024-06-01 17:18:24] [INFO ] After 86706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-06-01 17:18:24] [INFO ] After 87552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40002 steps (2876 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (321 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310924 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 310924 steps, saw 50739 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 17:18:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:18:27] [INFO ] Invariant cache hit.
[2024-06-01 17:18:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 4 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 240 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 4 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 226 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 212 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 3 ms to minimize.
SMT process timed out in 5286ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:18:33] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:18:33] [INFO ] Invariant cache hit.
[2024-06-01 17:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:18:46] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 3 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 3 ms to minimize.
[2024-06-01 17:18:47] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:18:48] [INFO ] Deduced a trap composed of 228 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 224 places in 175 ms of which 3 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 151 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 226 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:18:51] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 229 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 146 places in 213 ms of which 4 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 146 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 157 places in 244 ms of which 4 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 4 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 4 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 2 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:18:56] [INFO ] Deduced a trap composed of 177 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:18:57] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:18:59] [INFO ] Deduced a trap composed of 136 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 121 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 106 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 131 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 79 places in 254 ms of which 3 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 121 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 131 places in 224 ms of which 4 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 121 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 4 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 111 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 117 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 116 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 4 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 126 places in 260 ms of which 4 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 116 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 2 ms to minimize.
[2024-06-01 17:19:07] [INFO ] Deduced a trap composed of 175 places in 367 ms of which 4 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 151 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 111 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 161 places in 367 ms of which 6 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 140 places in 312 ms of which 4 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 152 places in 354 ms of which 4 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 121 places in 302 ms of which 3 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 136 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 3 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:19:11] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 155 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 151 places in 251 ms of which 3 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 146 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:19:13] [INFO ] Deduced a trap composed of 150 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:19:13] [INFO ] Deduced a trap composed of 146 places in 285 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 116 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 131 places in 282 ms of which 3 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 2 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 116 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 2 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 130 places in 250 ms of which 3 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 116 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 146 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 130 places in 288 ms of which 3 ms to minimize.
SMT process timed out in 44679ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 44692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44726 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 40000 steps (2918 resets) in 407 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (371 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 309874 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 309874 steps, saw 50586 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 17:19:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:19:20] [INFO ] Invariant cache hit.
[2024-06-01 17:19:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 4 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 226 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 3 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 240 places in 320 ms of which 4 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 234 places in 351 ms of which 4 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 226 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 232 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 224 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 212 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 236 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 3 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 216 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 220 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 208 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 232 places in 199 ms of which 2 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 236 places in 207 ms of which 2 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 230 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 242 places in 208 ms of which 2 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 224 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 2 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 2 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 230 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 204 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 2 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 2 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 220 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 4 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 230 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1242/1821 variables, 579/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1821 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1821 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1822 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1822 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1822 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16074 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 48/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:37] [INFO ] Deduced a trap composed of 230 places in 325 ms of which 3 ms to minimize.
[2024-06-01 17:19:37] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 238 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 3 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 4 ms to minimize.
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 2 ms to minimize.
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 222 places in 209 ms of which 2 ms to minimize.
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:19:40] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 2 ms to minimize.
[2024-06-01 17:19:40] [INFO ] Deduced a trap composed of 222 places in 210 ms of which 2 ms to minimize.
[2024-06-01 17:19:40] [INFO ] Deduced a trap composed of 244 places in 208 ms of which 2 ms to minimize.
[2024-06-01 17:19:40] [INFO ] Deduced a trap composed of 232 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:19:40] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:19:41] [INFO ] Deduced a trap composed of 234 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:19:41] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 3 ms to minimize.
[2024-06-01 17:19:41] [INFO ] Deduced a trap composed of 226 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:19:42] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:19:42] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:19:42] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 2 ms to minimize.
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 2 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 240 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 220 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 242 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:19:47] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:19:47] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:19:47] [INFO ] Deduced a trap composed of 230 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:19:48] [INFO ] Deduced a trap composed of 234 places in 307 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:19:48] [INFO ] Deduced a trap composed of 232 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:19:48] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:19:48] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:19:49] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:19:49] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 240 places in 355 ms of which 3 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 221 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:19:54] [INFO ] Deduced a trap composed of 236 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 225 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 225 places in 271 ms of which 4 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 224 places in 232 ms of which 2 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 2 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:20:02] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 2 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 220 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 3 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 240 places in 296 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/1822 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 62/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 112/112 constraints]
After SMT, in 61092ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 22 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:20:22] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:20:22] [INFO ] Invariant cache hit.
[2024-06-01 17:20:22] [INFO ] Implicit Places using invariants in 737 ms returned []
[2024-06-01 17:20:22] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:20:22] [INFO ] Invariant cache hit.
[2024-06-01 17:20:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:20:29] [INFO ] Implicit Places using invariants and state equation in 6763 ms returned []
Implicit Place search using SMT with State Equation took 7503 ms to find 0 implicit places.
[2024-06-01 17:20:29] [INFO ] Redundant transitions in 42 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:20:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:20:29] [INFO ] Invariant cache hit.
[2024-06-01 17:20:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:20:43] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 161 places in 214 ms of which 4 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 156 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 2 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 240 places in 164 ms of which 3 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 236 places in 163 ms of which 3 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 228 places in 165 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 234 places in 168 ms of which 2 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 171 places in 171 ms of which 5 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 224 places in 161 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 224 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 2 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 236 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:20:47] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 226 places in 232 ms of which 2 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 146 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 229 places in 249 ms of which 4 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:20:50] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 2 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 142 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 181 places in 262 ms of which 3 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 131 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 171 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 151 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 2 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 3 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 2 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 132 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 2 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 136 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:21:06] [INFO ] Deduced a trap composed of 121 places in 257 ms of which 3 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 121 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 121 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 106 places in 228 ms of which 4 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 4 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 78 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 131 places in 257 ms of which 3 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 121 places in 254 ms of which 3 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 111 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 117 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 116 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 4 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 131 places in 221 ms of which 4 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 126 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Deduced a trap composed of 116 places in 246 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:21:13] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 2 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 175 places in 382 ms of which 4 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 2 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 111 places in 297 ms of which 4 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 166 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:21:16] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:21:16] [INFO ] Deduced a trap composed of 140 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:21:16] [INFO ] Deduced a trap composed of 152 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 121 places in 375 ms of which 4 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 156 places in 328 ms of which 3 ms to minimize.
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 136 places in 326 ms of which 4 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 160 places in 351 ms of which 3 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 156 places in 363 ms of which 4 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 160 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 151 places in 329 ms of which 4 ms to minimize.
[2024-06-01 17:21:19] [INFO ] Deduced a trap composed of 155 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 151 places in 375 ms of which 3 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 146 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 150 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 146 places in 362 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 116 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 131 places in 351 ms of which 3 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 156 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 116 places in 295 ms of which 3 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 121 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 130 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 116 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 146 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 130 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 126 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:21:26] [INFO ] Deduced a trap composed of 120 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:21:27] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 3 ms to minimize.
[2024-06-01 17:21:27] [INFO ] Deduced a trap composed of 132 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:21:27] [INFO ] Deduced a trap composed of 106 places in 305 ms of which 4 ms to minimize.
[2024-06-01 17:21:28] [INFO ] Deduced a trap composed of 111 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:21:28] [INFO ] Deduced a trap composed of 161 places in 338 ms of which 3 ms to minimize.
[2024-06-01 17:21:28] [INFO ] Deduced a trap composed of 132 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:21:29] [INFO ] Deduced a trap composed of 135 places in 269 ms of which 2 ms to minimize.
[2024-06-01 17:21:29] [INFO ] Deduced a trap composed of 121 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:21:29] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:21:32] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:21:32] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 2 ms to minimize.
[2024-06-01 17:21:32] [INFO ] Deduced a trap composed of 182 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 4 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 4 ms to minimize.
[2024-06-01 17:21:34] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:21:34] [INFO ] Deduced a trap composed of 176 places in 226 ms of which 4 ms to minimize.
SMT process timed out in 64811ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 64828ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72403 ms. Remains : 580/580 places, 1251/1251 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 99 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2024-06-01 17:21:34] [INFO ] Computed 82 invariants in 25 ms
[2024-06-01 17:21:34] [INFO ] [Real]Absence check using 62 positive place invariants in 13 ms returned sat
[2024-06-01 17:21:34] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 33 ms returned sat
[2024-06-01 17:21:34] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:21:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 11 ms returned sat
[2024-06-01 17:21:34] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 28 ms returned sat
[2024-06-01 17:21:35] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:21:35] [INFO ] Deduced a trap composed of 264 places in 339 ms of which 4 ms to minimize.
[2024-06-01 17:21:36] [INFO ] Deduced a trap composed of 233 places in 333 ms of which 4 ms to minimize.
[2024-06-01 17:21:36] [INFO ] Deduced a trap composed of 243 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 228 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 231 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 237 places in 326 ms of which 3 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 241 places in 293 ms of which 4 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 233 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 3 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 253 places in 225 ms of which 2 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 230 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:21:40] [INFO ] Deduced a trap composed of 230 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:21:40] [INFO ] Deduced a trap composed of 240 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:21:40] [INFO ] Deduced a trap composed of 227 places in 296 ms of which 3 ms to minimize.
[2024-06-01 17:21:41] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 2 ms to minimize.
[2024-06-01 17:21:41] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 2 ms to minimize.
[2024-06-01 17:21:41] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 2 ms to minimize.
[2024-06-01 17:21:41] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 2 ms to minimize.
[2024-06-01 17:21:42] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 2 ms to minimize.
[2024-06-01 17:21:42] [INFO ] Deduced a trap composed of 246 places in 241 ms of which 2 ms to minimize.
[2024-06-01 17:21:42] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:21:43] [INFO ] Deduced a trap composed of 229 places in 239 ms of which 2 ms to minimize.
[2024-06-01 17:21:43] [INFO ] Deduced a trap composed of 247 places in 215 ms of which 2 ms to minimize.
[2024-06-01 17:21:43] [INFO ] Deduced a trap composed of 238 places in 215 ms of which 2 ms to minimize.
[2024-06-01 17:21:43] [INFO ] Deduced a trap composed of 244 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:21:44] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 2 ms to minimize.
[2024-06-01 17:21:44] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 2 ms to minimize.
[2024-06-01 17:21:44] [INFO ] Deduced a trap composed of 220 places in 255 ms of which 2 ms to minimize.
[2024-06-01 17:21:44] [INFO ] Deduced a trap composed of 222 places in 228 ms of which 2 ms to minimize.
[2024-06-01 17:21:45] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 3 ms to minimize.
[2024-06-01 17:21:45] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 3 ms to minimize.
[2024-06-01 17:21:46] [INFO ] Deduced a trap composed of 222 places in 360 ms of which 3 ms to minimize.
[2024-06-01 17:21:46] [INFO ] Deduced a trap composed of 234 places in 338 ms of which 3 ms to minimize.
[2024-06-01 17:21:47] [INFO ] Deduced a trap composed of 256 places in 397 ms of which 4 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 239 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 224 places in 307 ms of which 4 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 233 places in 303 ms of which 3 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 232 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 239 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 240 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 220 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 228 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 238 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 241 places in 299 ms of which 6 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 238 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 244 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 244 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 225 places in 319 ms of which 3 ms to minimize.
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 242 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 225 places in 333 ms of which 4 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 257 places in 326 ms of which 4 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 232 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:21:58] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:21:58] [INFO ] Deduced a trap composed of 241 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:21:59] [INFO ] Deduced a trap composed of 226 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:21:59] [INFO ] Deduced a trap composed of 228 places in 340 ms of which 3 ms to minimize.
[2024-06-01 17:21:59] [INFO ] Deduced a trap composed of 226 places in 319 ms of which 3 ms to minimize.
[2024-06-01 17:22:00] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:22:00] [INFO ] Deduced a trap composed of 224 places in 328 ms of which 3 ms to minimize.
[2024-06-01 17:22:00] [INFO ] Deduced a trap composed of 232 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:22:01] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:22:01] [INFO ] Deduced a trap composed of 233 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:22:01] [INFO ] Deduced a trap composed of 255 places in 285 ms of which 4 ms to minimize.
[2024-06-01 17:22:02] [INFO ] Deduced a trap composed of 239 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:22:02] [INFO ] Deduced a trap composed of 240 places in 315 ms of which 3 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 227 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:22:03] [INFO ] Deduced a trap composed of 222 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 238 places in 325 ms of which 3 ms to minimize.
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 231 places in 355 ms of which 4 ms to minimize.
[2024-06-01 17:22:04] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 4 ms to minimize.
[2024-06-01 17:22:05] [INFO ] Deduced a trap composed of 230 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 228 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 3 ms to minimize.
[2024-06-01 17:22:06] [INFO ] Deduced a trap composed of 234 places in 319 ms of which 3 ms to minimize.
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:22:08] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:22:08] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:22:08] [INFO ] Deduced a trap composed of 236 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 240 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 240 places in 281 ms of which 4 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 3 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 4 ms to minimize.
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 4 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 3 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 222 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:22:14] [INFO ] Deduced a trap composed of 227 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 226 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 245 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:22:15] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 4 ms to minimize.
[2024-06-01 17:22:16] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:22:17] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 226 places in 342 ms of which 4 ms to minimize.
[2024-06-01 17:22:19] [INFO ] Deduced a trap composed of 224 places in 329 ms of which 4 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 226 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 230 places in 322 ms of which 3 ms to minimize.
[2024-06-01 17:22:20] [INFO ] Deduced a trap composed of 224 places in 333 ms of which 4 ms to minimize.
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 3 ms to minimize.
[2024-06-01 17:22:21] [INFO ] Deduced a trap composed of 239 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 234 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:22:22] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 3 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 224 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 229 places in 336 ms of which 3 ms to minimize.
[2024-06-01 17:22:23] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:22:24] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 225 places in 312 ms of which 3 ms to minimize.
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 7 ms to minimize.
[2024-06-01 17:22:25] [INFO ] Deduced a trap composed of 236 places in 304 ms of which 3 ms to minimize.
[2024-06-01 17:22:26] [INFO ] Deduced a trap composed of 238 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:22:26] [INFO ] Deduced a trap composed of 224 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:22:26] [INFO ] Deduced a trap composed of 228 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:22:28] [INFO ] Deduced a trap composed of 224 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:22:28] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 3 ms to minimize.
[2024-06-01 17:22:28] [INFO ] Deduced a trap composed of 234 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 98391 ms
TRAPS : Iteration 1
[2024-06-01 17:23:14] [INFO ] After 99639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-06-01 17:23:14] [INFO ] After 99763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Over-approximation ignoring read arcs solved 0 properties in 100043 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1906
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1906
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1872
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 169 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-06-01 17:23:14] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-06-01 17:23:14] [INFO ] Computed 82 invariants in 54 ms
[2024-06-01 17:23:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-06-01 17:24:08] [INFO ] Deduced a trap composed of 242 places in 485 ms of which 7 ms to minimize.
[2024-06-01 17:24:08] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 74 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 2/2 constraints]
After SMT, in 56940ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 56965ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 57140 ms. Remains : 583/664 places, 1869/1940 transitions.
[2024-06-01 17:24:11] [INFO ] Flatten gal took : 70 ms
[2024-06-01 17:24:11] [INFO ] Flatten gal took : 75 ms
[2024-06-01 17:24:12] [INFO ] Input system was already deterministic with 1869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 38 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:24:12] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:24:12] [INFO ] Computed 82 invariants in 60 ms
[2024-06-01 17:24:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 56283ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 56303ms
Finished structural reductions in LTL mode , in 1 iterations and 56345 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-06-01 17:25:08] [INFO ] Flatten gal took : 113 ms
[2024-06-01 17:25:08] [INFO ] Flatten gal took : 119 ms
[2024-06-01 17:25:08] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 37 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:25:08] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-06-01 17:25:08] [INFO ] Invariant cache hit.
[2024-06-01 17:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 55643ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 55660ms
Finished structural reductions in LTL mode , in 1 iterations and 55701 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-06-01 17:26:04] [INFO ] Flatten gal took : 72 ms
[2024-06-01 17:26:04] [INFO ] Flatten gal took : 77 ms
[2024-06-01 17:26:04] [INFO ] Input system was already deterministic with 1939 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1868
Applied a total of 144 rules in 107 ms. Remains 582 /664 variables (removed 82) and now considering 1868/1940 (removed 72) transitions.
Running 1857 sub problems to find dead transitions.
[2024-06-01 17:26:04] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
// Phase 1: matrix 1859 rows 582 cols
[2024-06-01 17:26:04] [INFO ] Computed 82 invariants in 43 ms
[2024-06-01 17:26:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2441 variables, and 72 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-06-01 17:26:43] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 1 ms to minimize.
[2024-06-01 17:26:57] [INFO ] Deduced a trap composed of 96 places in 462 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2441 variables, and 74 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/857 constraints, Known Traps: 2/2 constraints]
After SMT, in 56124ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 56140ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56251 ms. Remains : 582/664 places, 1868/1940 transitions.
[2024-06-01 17:27:01] [INFO ] Flatten gal took : 75 ms
[2024-06-01 17:27:01] [INFO ] Flatten gal took : 81 ms
[2024-06-01 17:27:01] [INFO ] Input system was already deterministic with 1868 transitions.
RANDOM walk for 24564 steps (1666 resets) in 504 ms. (48 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 85 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-06-01 17:27:01] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-06-01 17:27:01] [INFO ] Computed 82 invariants in 52 ms
[2024-06-01 17:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 8)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 3)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 2)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 2)
(s209 0)
(s210 0)
(s211 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 56339ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 56363ms
Finished structural reductions in LTL mode , in 1 iterations and 56461 ms. Remains : 653/664 places, 1939/1940 transitions.
[2024-06-01 17:27:58] [INFO ] Flatten gal took : 101 ms
[2024-06-01 17:27:58] [INFO ] Flatten gal took : 105 ms
[2024-06-01 17:27:58] [INFO ] Input system was already deterministic with 1939 transitions.
[2024-06-01 17:27:58] [INFO ] Flatten gal took : 119 ms
[2024-06-01 17:27:58] [INFO ] Flatten gal took : 119 ms
[2024-06-01 17:27:59] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 28 ms.
[2024-06-01 17:27:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1940 transitions and 13349 arcs took 10 ms.
Total runtime 1703739 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLFireability-2024-15

BK_STOP 1717262879719

--------------------
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 PolyORBNT-PT-S10J30-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/3602/ctl_0_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/3602/ctl_1_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/3602/ctl_2_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/3602/ctl_3_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/3602/ctl_4_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/3602/ctl_5_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/3602/ctl_6_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/3602/ctl_7_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/3602/ctl_8_
ctl formula name PolyORBNT-PT-S10J30-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/3602/ctl_9_
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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r516-tajo-171654447200490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;