Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662339500883.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResAllocation-PT-R100C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339500883
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717265639132

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:14:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:14:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:14:00] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-01 18:14:00] [INFO ] Transformed 400 places.
[2024-06-01 18:14:00] [INFO ] Transformed 202 transitions.
[2024-06-01 18:14:00] [INFO ] Found NUPN structural information;
[2024-06-01 18:14:00] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 47 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2024-06-01 18:14:00] [INFO ] Computed 200 invariants in 20 ms
[2024-06-01 18:14:01] [INFO ] Implicit Places using invariants in 522 ms returned [201, 203, 205, 207, 209, 211, 213, 215, 221, 223, 225, 227, 229, 233, 235, 237, 239, 241, 243, 245, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 299, 301, 303, 305, 307, 309, 311, 315, 317, 319, 323, 325, 327, 329, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349, 351, 353, 355, 357, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397, 399]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 556 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 309/400 places, 202/202 transitions.
Applied a total of 0 rules in 16 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 309/400 places, 202/202 transitions.
Support contains 38 out of 309 places after structural reductions.
[2024-06-01 18:14:01] [INFO ] Flatten gal took : 44 ms
[2024-06-01 18:14:01] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:14:01] [INFO ] Input system was already deterministic with 202 transitions.
RANDOM walk for 40000 steps (12 resets) in 2246 ms. (17 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
// Phase 1: matrix 202 rows 309 cols
[2024-06-01 18:14:02] [INFO ] Computed 109 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/31 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6/37 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/79 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 92/171 variables, 58/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 58/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 73/244 variables, 45/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 45/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 15/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 62/306 variables, 40/370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 40/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 14/424 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 44/350 variables, 28/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/350 variables, 28/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/350 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/350 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 38/388 variables, 24/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/388 variables, 24/538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/388 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/388 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 28/416 variables, 18/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/416 variables, 18/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/416 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/416 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 20/436 variables, 12/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/436 variables, 12/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/436 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/436 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 16/452 variables, 10/626 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/452 variables, 10/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/452 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/452 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 16/468 variables, 10/650 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/468 variables, 10/660 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/468 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/468 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 10/478 variables, 6/670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/478 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/478 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/478 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 10/488 variables, 6/684 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/488 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/488 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/488 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (OVERLAPS) 10/498 variables, 6/698 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/498 variables, 6/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/498 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/498 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (OVERLAPS) 10/508 variables, 6/712 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/508 variables, 6/718 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/508 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/508 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 63 (OVERLAPS) 3/511 variables, 3/723 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/511 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/511 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/511 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 67 (OVERLAPS) 0/511 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 727 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1278 ms.
Refiners :[Domain max(s): 309/309 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/31 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6/37 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/79 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 92/171 variables, 58/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 58/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 73/244 variables, 45/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 45/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 15/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 11 ms to minimize.
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/244 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 62/306 variables, 40/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 40/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 14/434 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/306 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:14:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/306 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/306 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 44/350 variables, 28/464 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/350 variables, 28/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/350 variables, 10/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/350 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 38/388 variables, 24/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/388 variables, 24/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/388 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/388 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 28/416 variables, 18/576 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/416 variables, 18/594 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/416 variables, 6/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/416 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 20/436 variables, 12/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/436 variables, 12/624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/436 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/436 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 16/452 variables, 10/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/452 variables, 10/648 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/452 variables, 4/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/452 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 16/468 variables, 10/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/468 variables, 10/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/468 variables, 4/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/468 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (OVERLAPS) 10/478 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/478 variables, 6/688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/478 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/478 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 10/488 variables, 6/696 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/488 variables, 6/702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/488 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/488 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (OVERLAPS) 10/498 variables, 6/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/498 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/498 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/498 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 64 (OVERLAPS) 10/508 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/508 variables, 6/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/508 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/508 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 68 (OVERLAPS) 3/511 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/511 variables, 3/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/511 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 18:14:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:14:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/511 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/511 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 73 (OVERLAPS) 0/511 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 741 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3916 ms.
Refiners :[Domain max(s): 309/309 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 5239ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 5354 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 307 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 303 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 301 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 301 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 297 transition count 194
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 24 place count 295 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 295 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 291 transition count 190
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 34 place count 289 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 289 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 285 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 283 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 283 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 279 transition count 182
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 5 with 4 rules applied. Total rules applied 54 place count 277 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 277 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 273 transition count 178
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 6 with 4 rules applied. Total rules applied 64 place count 271 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 271 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 267 transition count 174
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 7 with 2 rules applied. Total rules applied 72 place count 266 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 73 place count 266 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 75 place count 264 transition count 172
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 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 78 place count 262 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 79 place count 262 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 81 place count 260 transition count 170
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 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 84 place count 258 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 85 place count 258 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 87 place count 256 transition count 168
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 10 with 2 rules applied. Total rules applied 89 place count 255 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 90 place count 255 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 92 place count 253 transition count 166
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 11 with 2 rules applied. Total rules applied 94 place count 252 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 95 place count 252 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 97 place count 250 transition count 164
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 12 with 2 rules applied. Total rules applied 99 place count 249 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 100 place count 249 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 102 place count 247 transition count 162
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 13 with 2 rules applied. Total rules applied 104 place count 246 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 105 place count 246 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 107 place count 244 transition count 160
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 14 with 2 rules applied. Total rules applied 109 place count 243 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 110 place count 243 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 112 place count 241 transition count 158
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 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 115 place count 239 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 116 place count 239 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 118 place count 237 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 120 place count 236 transition count 155
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 121 place count 236 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 123 place count 234 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 125 place count 233 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 126 place count 233 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 128 place count 231 transition count 152
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 18 with 2 rules applied. Total rules applied 130 place count 230 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 131 place count 230 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 133 place count 228 transition count 150
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 19 with 2 rules applied. Total rules applied 135 place count 227 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 136 place count 227 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 138 place count 225 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 140 place count 224 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 141 place count 224 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 143 place count 222 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 145 place count 221 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 146 place count 221 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 148 place count 219 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 150 place count 218 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 151 place count 218 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 153 place count 216 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 3 rules applied. Total rules applied 156 place count 214 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 157 place count 214 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 159 place count 212 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 161 place count 211 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 162 place count 211 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 164 place count 209 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 166 place count 208 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 167 place count 208 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 169 place count 206 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 171 place count 205 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 172 place count 205 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 174 place count 203 transition count 134
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 27 with 2 rules applied. Total rules applied 176 place count 202 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 177 place count 202 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 179 place count 200 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 181 place count 199 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 182 place count 199 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 184 place count 197 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 186 place count 196 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 187 place count 196 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 189 place count 194 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 191 place count 193 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 192 place count 193 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 194 place count 191 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 196 place count 190 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 197 place count 190 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 199 place count 188 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 201 place count 187 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 202 place count 187 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 204 place count 185 transition count 122
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 33 with 2 rules applied. Total rules applied 206 place count 184 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 207 place count 184 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 209 place count 182 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 211 place count 181 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 212 place count 181 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 214 place count 179 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 216 place count 178 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 217 place count 178 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 219 place count 176 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 221 place count 175 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 222 place count 175 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 224 place count 173 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 3 rules applied. Total rules applied 227 place count 171 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 228 place count 171 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 230 place count 169 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 232 place count 168 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 233 place count 168 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 235 place count 166 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 39 with 2 rules applied. Total rules applied 237 place count 165 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 238 place count 165 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 240 place count 163 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 40 with 2 rules applied. Total rules applied 242 place count 162 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 243 place count 162 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 245 place count 160 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 41 with 2 rules applied. Total rules applied 247 place count 159 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 248 place count 159 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 250 place count 157 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 42 with 2 rules applied. Total rules applied 252 place count 156 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 253 place count 156 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 255 place count 154 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 257 place count 153 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 258 place count 153 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 260 place count 151 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 44 with 2 rules applied. Total rules applied 262 place count 150 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 263 place count 150 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 265 place count 148 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 45 with 2 rules applied. Total rules applied 267 place count 147 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 268 place count 147 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 45 with 2 rules applied. Total rules applied 270 place count 145 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 46 with 2 rules applied. Total rules applied 272 place count 144 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 273 place count 144 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 275 place count 142 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 47 with 2 rules applied. Total rules applied 277 place count 141 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 47 with 1 rules applied. Total rules applied 278 place count 141 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 280 place count 139 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 48 with 3 rules applied. Total rules applied 283 place count 137 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 48 with 1 rules applied. Total rules applied 284 place count 137 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 48 with 2 rules applied. Total rules applied 286 place count 135 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 49 with 2 rules applied. Total rules applied 288 place count 134 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 49 with 1 rules applied. Total rules applied 289 place count 134 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 291 place count 132 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 50 with 2 rules applied. Total rules applied 293 place count 131 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 50 with 1 rules applied. Total rules applied 294 place count 131 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 50 with 2 rules applied. Total rules applied 296 place count 129 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 51 with 2 rules applied. Total rules applied 298 place count 128 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 51 with 1 rules applied. Total rules applied 299 place count 128 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 51 with 2 rules applied. Total rules applied 301 place count 126 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 52 with 2 rules applied. Total rules applied 303 place count 125 transition count 83
Free-agglomeration rule applied 1 times.
Iterating global reduction 52 with 1 rules applied. Total rules applied 304 place count 125 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 52 with 2 rules applied. Total rules applied 306 place count 123 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 53 with 2 rules applied. Total rules applied 308 place count 122 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 53 with 1 rules applied. Total rules applied 309 place count 122 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 311 place count 120 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 54 with 2 rules applied. Total rules applied 313 place count 119 transition count 79
Free-agglomeration rule applied 1 times.
Iterating global reduction 54 with 1 rules applied. Total rules applied 314 place count 119 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 316 place count 117 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 55 with 2 rules applied. Total rules applied 318 place count 116 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 55 with 1 rules applied. Total rules applied 319 place count 116 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 55 with 2 rules applied. Total rules applied 321 place count 114 transition count 76
Applied a total of 321 rules in 426 ms. Remains 114 /309 variables (removed 195) and now considering 76/202 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 114/309 places, 76/202 transitions.
RANDOM walk for 40000 steps (106 resets) in 249 ms. (160 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
// Phase 1: matrix 76 rows 114 cols
[2024-06-01 18:14:13] [INFO ] Computed 40 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/22 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 25/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/72 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 25/97 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/97 variables, 15/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/97 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 25/122 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/122 variables, 15/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 25/147 variables, 15/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/147 variables, 15/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/147 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 16/163 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/163 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/163 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/163 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 6/169 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/169 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/169 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 5/174 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/174 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/174 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/174 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 5/179 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/179 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/179 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/179 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 5/184 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/184 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/184 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/184 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 6/190 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/190 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/190 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/190 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 0/190 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 189 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/22 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 25/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/47 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 25/72 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/72 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 25/97 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/97 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/97 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/97 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 25/122 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 15/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/122 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 25/147 variables, 15/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/147 variables, 15/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/147 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/147 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 16/163 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/163 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/163 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:14:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/163 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/163 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 6/169 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/169 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/169 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/169 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 5/174 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/174 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/174 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/174 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 5/179 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/179 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/179 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/179 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 5/184 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/184 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/184 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/184 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 6/190 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/190 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/190 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/190 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 0/190 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 417 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 123 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 7 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 9 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-06-01 18:14:14] [INFO ] Computed 109 invariants in 2 ms
[2024-06-01 18:14:14] [INFO ] Implicit Places using invariants in 188 ms returned [207, 209, 216, 225, 240, 252, 261, 266, 286]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 191 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/309 places, 200/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 298/309 places, 200/202 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-04
Product exploration explored 100000 steps with 473 reset in 396 ms.
Product exploration explored 100000 steps with 462 reset in 417 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 686 steps (0 resets) in 7 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 298 cols
[2024-06-01 18:14:16] [INFO ] Computed 100 invariants in 4 ms
[2024-06-01 18:14:16] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 18:14:16] [INFO ] Invariant cache hit.
[2024-06-01 18:14:17] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-06-01 18:14:17] [INFO ] Redundant transitions in 6 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:14:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 298/298 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 100/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:14:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:14:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:14:20] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:14:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:14:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:14:24] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:14:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 18:14:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 9 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:25] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:14:26] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:14:27] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:14:27] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:14:27] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:14:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:14:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:14:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:14:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:14:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:14:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:14:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 16/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/498 variables, 298/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 792 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22878 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 298/298 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 100/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 96/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/498 variables, 298/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 198/990 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:09] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 991 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30022 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 52944ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52948ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53652 ms. Remains : 298/298 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 819 steps (0 resets) in 7 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 463 reset in 351 ms.
Product exploration explored 100000 steps with 476 reset in 365 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 16 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:15:11] [INFO ] Invariant cache hit.
[2024-06-01 18:15:11] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-01 18:15:11] [INFO ] Invariant cache hit.
[2024-06-01 18:15:12] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2024-06-01 18:15:12] [INFO ] Redundant transitions in 6 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 298/298 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 100/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:15:14] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 23 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
[2024-06-01 18:15:15] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 18:15:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:15:16] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 18:15:17] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:15:18] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:20] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:15:20] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:15:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:15:20] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:15:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:15:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:15:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:15:22] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:15:23] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:15:24] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:15:26] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:15:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:15:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:15:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:15:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 16/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/498 variables, 298/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 792 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23740 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 298/298 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 100/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 96/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/498 variables, 298/792 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 198/990 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:05] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 991 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30028 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 53853ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 53855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54724 ms. Remains : 298/298 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-04 finished in 111511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X((F(p2)&&G(p3)))&&p1))))'
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-06-01 18:16:06] [INFO ] Computed 109 invariants in 1 ms
[2024-06-01 18:16:06] [INFO ] Implicit Places using invariants in 466 ms returned [209, 211, 218, 227, 242, 254, 263, 288]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 467 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 477 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06
Product exploration explored 100000 steps with 193 reset in 424 ms.
Product exploration explored 100000 steps with 200 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p3)), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 183 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 4 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (12 resets) in 328 ms. (121 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
// Phase 1: matrix 202 rows 301 cols
[2024-06-01 18:16:08] [INFO ] Computed 101 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/35 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/35 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/55 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/55 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/55 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/55 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/75 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/75 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/75 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/75 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/95 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/95 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/95 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/115 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/115 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/115 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/115 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 20/135 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/135 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/135 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/135 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 20/155 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/155 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/155 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/155 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 18/173 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/173 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/173 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/173 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 10/183 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/183 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/183 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/183 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 10/193 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/193 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/193 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 10/203 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/203 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/203 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 10/213 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/213 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/213 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/213 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 10/223 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/223 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/223 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/223 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 10/233 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/233 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/233 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/233 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 10/243 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/243 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/243 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 10/253 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/253 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/253 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/253 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 10/263 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/263 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/263 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/263 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 10/273 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/273 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/273 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/273 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 10/283 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/283 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/283 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/283 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 10/293 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/293 variables, 6/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/293 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/293 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 10/303 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/303 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/303 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/303 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 10/313 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/313 variables, 6/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/313 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/313 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 5/318 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/318 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/318 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 5/323 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/323 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/323 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/323 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 5/328 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/328 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/328 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/328 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 5/333 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/333 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/333 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/333 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 5/338 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/338 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/338 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/338 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 5/343 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/343 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/343 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/343 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 5/348 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/348 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/348 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/348 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 5/353 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/353 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/353 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/353 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 5/358 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/358 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/358 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/358 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 5/363 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/363 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/363 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/363 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 5/368 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/368 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/368 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/368 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 5/373 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/373 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/373 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/373 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 5/378 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/378 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/378 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/378 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 5/383 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/383 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/383 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/383 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 5/388 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/388 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/388 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/388 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 5/393 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/393 variables, 3/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/393 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/393 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 5/398 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/398 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/398 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/398 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 5/403 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/403 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/403 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/403 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (OVERLAPS) 5/408 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/408 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/408 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/408 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 5/413 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/413 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/413 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/413 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 5/418 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/418 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/418 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/418 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 5/423 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/423 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/423 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/423 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 5/428 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/428 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/428 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/428 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 5/433 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/433 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/433 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/433 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 5/438 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/438 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/438 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/438 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 5/443 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/443 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/443 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/443 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (OVERLAPS) 5/448 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/448 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/448 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/448 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (OVERLAPS) 5/453 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/453 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/453 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/453 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 5/458 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/458 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/458 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/458 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 5/463 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/463 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/463 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/463 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (OVERLAPS) 5/468 variables, 3/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/468 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/468 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/468 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 5/473 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/473 variables, 3/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/473 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/473 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 5/478 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/478 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/478 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/478 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (OVERLAPS) 5/483 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/483 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/483 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/483 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (OVERLAPS) 5/488 variables, 3/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/488 variables, 3/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/488 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/488 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 5/493 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/493 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/493 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/493 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (OVERLAPS) 5/498 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/498 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/498 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/498 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 5/503 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/503 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/503 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/503 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 0/503 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 946 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 2/503 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Domain max(s): 2/301 constraints, Positive P Invariants (semi-flows): 0/101 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 978ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p3)), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p3 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT p3)), (F (NOT (AND p3 (NOT p2)))), (F p2), (F (NOT (AND p0 p3))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 606 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 299 transition count 200
Applied a total of 4 rules in 7 ms. Remains 299 /301 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 299 cols
[2024-06-01 18:16:10] [INFO ] Computed 101 invariants in 1 ms
[2024-06-01 18:16:10] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 18:16:10] [INFO ] Invariant cache hit.
[2024-06-01 18:16:11] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2024-06-01 18:16:11] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:16:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 18:16:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-06-01 18:16:14] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-06-01 18:16:15] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:16:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:16:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-06-01 18:16:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:16:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:16:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:16:17] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:19] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:16:19] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:16:19] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:16:19] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:16:20] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:16:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:16:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:16:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:16:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:16:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:16:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:16:23] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:16:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:16:24] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:16:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 795 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22993 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 96/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 198/993 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:01] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 994 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30018 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 53064ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 53071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 299/301 places, 200/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53872 ms. Remains : 299/301 places, 200/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p1)), (X (AND p0 p3)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p3))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 119 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 3819 steps (0 resets) in 38 ms. (97 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p1)), (X (AND p0 p3)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p3))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p3 (NOT p1)))), (F (NOT (AND p0 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3 p1))), (F (NOT p3)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p0))]
Knowledge based reduction with 27 factoid took 516 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 64 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 363 ms.
Product exploration explored 100000 steps with 38 reset in 418 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:17:06] [INFO ] Invariant cache hit.
[2024-06-01 18:17:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 18:17:06] [INFO ] Invariant cache hit.
[2024-06-01 18:17:06] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-06-01 18:17:06] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:17:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:08] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:17:08] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-06-01 18:17:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:17:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:17:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 3 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:17:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 18:17:10] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:17:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:17:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:17:10] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:17:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:17:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:17:14] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:17:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-06-01 18:17:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:17:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:17:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:17:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 18:17:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:17:20] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:17:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-06-01 18:17:21] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 18:17:21] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 795 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22690 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 96/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 198/993 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:17:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 994 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30018 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 52745ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52747ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53398 ms. Remains : 299/299 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 113252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-06-01 18:17:59] [INFO ] Computed 109 invariants in 1 ms
[2024-06-01 18:17:59] [INFO ] Implicit Places using invariants in 170 ms returned [209, 211, 218, 227, 242, 254, 263, 268, 288]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 186 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 300/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-07 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(p1)||(!p2 U (p3||G(!p2))))))'
Support contains 8 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-06-01 18:18:00] [INFO ] Invariant cache hit.
[2024-06-01 18:18:00] [INFO ] Implicit Places using invariants in 181 ms returned [209, 211, 218, 227, 242, 254, 263, 268, 288]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 207 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 300/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) p2), true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-08
Stuttering criterion allowed to conclude after 2559 steps with 0 reset in 11 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-08 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-06-01 18:18:00] [INFO ] Invariant cache hit.
[2024-06-01 18:18:00] [INFO ] Implicit Places using invariants in 159 ms returned [209, 211, 218, 242, 254, 263, 268, 288]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 187 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 129 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-09 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((F(p2)||p1) U p3)||p0))))'
Support contains 5 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 7 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-06-01 18:18:00] [INFO ] Computed 109 invariants in 1 ms
[2024-06-01 18:18:01] [INFO ] Implicit Places using invariants in 324 ms returned [207, 225, 240, 252, 266, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 340 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/309 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 350 ms. Remains : 301/309 places, 200/202 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-11
Product exploration explored 100000 steps with 38 reset in 323 ms.
Product exploration explored 100000 steps with 38 reset in 372 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (12 resets) in 360 ms. (110 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
// Phase 1: matrix 200 rows 301 cols
[2024-06-01 18:18:02] [INFO ] Computed 103 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/18 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/38 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 50/88 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 50/138 variables, 30/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/138 variables, 30/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/138 variables, 10/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/138 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 43/181 variables, 27/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/181 variables, 27/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/181 variables, 9/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/181 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/221 variables, 24/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 40/261 variables, 24/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/261 variables, 24/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/261 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/261 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 38/299 variables, 24/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/299 variables, 24/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/299 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/299 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 28/327 variables, 17/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/327 variables, 17/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/327 variables, 6/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/327 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 25/352 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/352 variables, 15/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/352 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/352 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 23/375 variables, 14/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/375 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/375 variables, 5/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/375 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 20/395 variables, 12/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/395 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/395 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/395 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 20/415 variables, 12/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/415 variables, 12/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/415 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/415 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 20/435 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/435 variables, 12/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/435 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/435 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 20/455 variables, 12/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/455 variables, 12/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/455 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/455 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 13/468 variables, 9/644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/468 variables, 9/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/468 variables, 3/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/468 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 10/478 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/478 variables, 6/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/478 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/478 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 10/488 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/488 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/488 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/488 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 10/498 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/498 variables, 6/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/498 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/498 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 3/501 variables, 3/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/501 variables, 3/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/501 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/501 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 0/501 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 580 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/18 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/38 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 50/88 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 50/138 variables, 30/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/138 variables, 30/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/138 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/138 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 43/181 variables, 27/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/181 variables, 27/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/181 variables, 9/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/181 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 40/221 variables, 24/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/221 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 40/261 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/261 variables, 24/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/261 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/261 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 38/299 variables, 24/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/299 variables, 24/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/299 variables, 8/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/299 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 28/327 variables, 17/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/327 variables, 17/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/327 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/327 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 25/352 variables, 15/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/352 variables, 15/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/352 variables, 5/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/352 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 23/375 variables, 14/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/375 variables, 14/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/375 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/375 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 20/395 variables, 12/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/395 variables, 12/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/395 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/395 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 20/415 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/415 variables, 12/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/415 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/415 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 20/435 variables, 12/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/435 variables, 12/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/435 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/435 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 20/455 variables, 12/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/455 variables, 12/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/455 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/455 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 13/468 variables, 9/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/468 variables, 9/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/468 variables, 3/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/468 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 10/478 variables, 6/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/478 variables, 6/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/478 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/478 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 10/488 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/488 variables, 6/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/488 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/488 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 10/498 variables, 6/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/498 variables, 6/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/498 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/498 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 3/501 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/501 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/501 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/501 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 0/501 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 707 constraints, problems are : Problem set: 0 solved, 2 unsolved in 832 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 578 steps, including 1 resets, run visited all 2 properties in 8 ms. (steps per millisecond=72 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p3 p0), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (NOT (OR p3 p0)))]
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Support contains 5 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:18:04] [INFO ] Invariant cache hit.
[2024-06-01 18:18:04] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 18:18:04] [INFO ] Invariant cache hit.
[2024-06-01 18:18:04] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-06-01 18:18:04] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:18:06] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 18:18:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:18:07] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:08] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-06-01 18:18:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:08] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:18:08] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:18:08] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:18:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:18:10] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:11] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:18:12] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:18:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:18:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:13] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:18:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:18:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:18:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:18:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:18:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:18:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:18:19] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 16/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 801 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22467 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 96/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 999 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30018 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
After SMT, in 52511ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52513ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53091 ms. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (12 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 38867 steps, run visited all 3 properties in 290 ms. (steps per millisecond=134 )
Probabilistic random walk after 38867 steps, saw 27941 distinct states, run finished after 293 ms. (steps per millisecond=132 ) properties seen :3
Knowledge obtained : [(AND p3 p0), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (NOT (OR p3 p0)))]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 38 reset in 317 ms.
Product exploration explored 100000 steps with 38 reset in 385 ms.
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:18:59] [INFO ] Invariant cache hit.
[2024-06-01 18:18:59] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 18:18:59] [INFO ] Invariant cache hit.
[2024-06-01 18:18:59] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-06-01 18:18:59] [INFO ] Redundant transitions in 7 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:18:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:01] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
[2024-06-01 18:19:02] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:19:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-06-01 18:19:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:19:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:05] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:06] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:19:06] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:06] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:19:07] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:19:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:19:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:19:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 16/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 801 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21437 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 96/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 999 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30011 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
After SMT, in 51498ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 51500ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52125 ms. Remains : 301/301 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-11 finished in 110316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 309 cols
[2024-06-01 18:19:51] [INFO ] Computed 109 invariants in 1 ms
[2024-06-01 18:19:51] [INFO ] Implicit Places using invariants in 173 ms returned [209, 211, 218, 227, 242, 254, 263, 268]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 187 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/309 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 301/309 places, 202/202 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-13
Stuttering criterion allowed to conclude after 2551 steps with 0 reset in 13 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-13 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 5 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-06-01 18:19:51] [INFO ] Computed 109 invariants in 4 ms
[2024-06-01 18:19:51] [INFO ] Implicit Places using invariants in 201 ms returned [209, 216, 225, 261, 266, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 201 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/309 places, 200/202 transitions.
Applied a total of 0 rules in 17 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 301/309 places, 200/202 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-14
Product exploration explored 100000 steps with 51 reset in 356 ms.
Product exploration explored 100000 steps with 51 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22405 steps (7 resets) in 92 ms. (240 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2024-06-01 18:19:53] [INFO ] Computed 103 invariants in 1 ms
[2024-06-01 18:19:53] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 18:19:53] [INFO ] Invariant cache hit.
[2024-06-01 18:19:53] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-06-01 18:19:53] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:19:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:19:55] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:19:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:57] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:19:57] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:19:57] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 8 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:19:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:19:59] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:20:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:20:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 18:20:04] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:05] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:20:06] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 18:20:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 16/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 801 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22103 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 96/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 999 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
After SMT, in 52161ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52888 ms. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24888 steps (8 resets) in 120 ms. (205 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 57 reset in 312 ms.
Product exploration explored 100000 steps with 57 reset in 363 ms.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:20:47] [INFO ] Invariant cache hit.
[2024-06-01 18:20:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 18:20:47] [INFO ] Invariant cache hit.
[2024-06-01 18:20:47] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-01 18:20:47] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:20:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-06-01 18:20:50] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:51] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 18:20:51] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 18:20:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:20:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-06-01 18:20:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:56] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:20:57] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:20:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 18:20:59] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:21:00] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:21:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 16/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 801 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22403 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 96/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/801 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/999 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 999 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30023 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
After SMT, in 52452ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53025 ms. Remains : 301/301 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-14 finished in 108538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X((F(p2)&&G(p3)))&&p1))))'
Found a Shortening insensitive property : ResAllocation-PT-R100C002-LTLCardinality-06
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 309/309 places, 202/202 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 307 transition count 200
Applied a total of 4 rules in 8 ms. Remains 307 /309 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 307 cols
[2024-06-01 18:21:40] [INFO ] Computed 109 invariants in 1 ms
[2024-06-01 18:21:40] [INFO ] Implicit Places using invariants in 161 ms returned [207, 209, 216, 225, 240, 252, 261, 286]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 299/309 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 187 ms. Remains : 299/309 places, 200/202 transitions.
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06
Product exploration explored 100000 steps with 197 reset in 324 ms.
Product exploration explored 100000 steps with 202 reset in 380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p3)), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 141 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 4 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (12 resets) in 293 ms. (136 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
// Phase 1: matrix 200 rows 299 cols
[2024-06-01 18:21:41] [INFO ] Computed 101 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/35 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/35 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/55 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/55 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/55 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/55 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/75 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/75 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/75 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/75 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 20/95 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/95 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/95 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/115 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/115 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/115 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/115 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 20/135 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/135 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/135 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/135 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 20/155 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/155 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/155 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/155 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 18/173 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/173 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/173 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/173 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 10/183 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/183 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/183 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/183 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 10/193 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/193 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/193 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 10/203 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/203 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/203 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 10/213 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/213 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/213 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/213 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 10/223 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/223 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/223 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/223 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 10/233 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/233 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/233 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/233 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 10/243 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/243 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/243 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 10/253 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/253 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/253 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/253 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 10/263 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/263 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/263 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/263 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 10/273 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/273 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/273 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/273 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 10/283 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/283 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/283 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/283 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 10/293 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/293 variables, 6/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/293 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/293 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 10/303 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/303 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/303 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/303 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 8/311 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/311 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/311 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/311 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 5/316 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/316 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/316 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/316 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 5/321 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/321 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/321 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/321 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 5/326 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/326 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/326 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/326 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 5/331 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/331 variables, 3/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/331 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/331 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 5/336 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/336 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/336 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/336 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 5/341 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/341 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/341 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/341 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 5/346 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/346 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/346 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/346 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 5/351 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/351 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/351 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/351 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 5/356 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/356 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/356 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/356 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 5/361 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/361 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/361 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/361 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 5/366 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/366 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/366 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/366 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 5/371 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/371 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/371 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/371 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 5/376 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/376 variables, 3/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/376 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/376 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 5/381 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/381 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/381 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/381 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 5/386 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/386 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/386 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/386 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 5/391 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/391 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/391 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/391 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 5/396 variables, 3/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/396 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/396 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/396 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 5/401 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/401 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/401 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/401 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (OVERLAPS) 5/406 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/406 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/406 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/406 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 5/411 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/411 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/411 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/411 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 5/416 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/416 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/416 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/416 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 5/421 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/421 variables, 3/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/421 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/421 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 5/426 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/426 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/426 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/426 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 5/431 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/431 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/431 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/431 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 5/436 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/436 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/436 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/436 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 5/441 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/441 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/441 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/441 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (OVERLAPS) 5/446 variables, 3/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/446 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/446 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/446 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (OVERLAPS) 5/451 variables, 3/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/451 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/451 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/451 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 5/456 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/456 variables, 3/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/456 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/456 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 5/461 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/461 variables, 3/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/461 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/461 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (OVERLAPS) 5/466 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/466 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/466 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/466 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 5/471 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/471 variables, 3/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/471 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/471 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 5/476 variables, 3/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/476 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/476 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/476 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (OVERLAPS) 5/481 variables, 3/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/481 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/481 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/481 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (OVERLAPS) 5/486 variables, 3/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/486 variables, 3/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/486 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/486 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 5/491 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/491 variables, 3/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/491 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/491 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (OVERLAPS) 5/496 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/496 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/496 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/496 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 3/499 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/499 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/499 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 2/499 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 2/299 constraints, Positive P Invariants (semi-flows): 0/101 constraints, State Equation: 0/299 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p2) p3)), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p3)))), (X (AND p0 p3)), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p3))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p3 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT p3)), (F (NOT (AND p3 (NOT p2)))), (F p2), (F (NOT (AND p0 p3))), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 593 ms. Reduced automaton from 4 states, 19 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 56 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:21:43] [INFO ] Invariant cache hit.
[2024-06-01 18:21:43] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 18:21:43] [INFO ] Invariant cache hit.
[2024-06-01 18:21:44] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-01 18:21:44] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:21:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:45] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-06-01 18:21:45] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:21:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:21:47] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:21:48] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:21:49] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:21:50] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:21:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:51] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:21:51] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:21:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:21:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:21:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:21:53] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:21:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:21:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:21:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:21:55] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:21:57] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:21:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:21:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 795 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22281 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 96/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 198/993 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 994 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30033 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 52356ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 52358ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52960 ms. Remains : 299/299 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p1)), (X (AND p0 p3)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p3))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 106 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 3414 steps (0 resets) in 28 ms. (117 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 p1 p3), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p1)), (X (AND p0 p3)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p3))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p3 (NOT p1)))), (F (NOT (AND p0 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3 p1))), (F (NOT p3)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p0))]
Knowledge based reduction with 27 factoid took 431 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 38 reset in 348 ms.
Product exploration explored 100000 steps with 38 reset in 397 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-06-01 18:22:38] [INFO ] Invariant cache hit.
[2024-06-01 18:22:38] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 18:22:38] [INFO ] Invariant cache hit.
[2024-06-01 18:22:38] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2024-06-01 18:22:38] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 18:22:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:22:43] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:45] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-06-01 18:22:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 18:22:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 795 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20639 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 96/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/499 variables, 299/795 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 198/993 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 18:23:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 994 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30023 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 97/97 constraints]
After SMT, in 50693ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 50697ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51269 ms. Remains : 299/299 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 109109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((F(p2)||p1) U p3)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 18:23:29] [INFO ] Flatten gal took : 16 ms
[2024-06-01 18:23:29] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 18:23:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 202 transitions and 818 arcs took 5 ms.
Total runtime 569284 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-04
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-06
Could not compute solution for formula : ResAllocation-PT-R100C002-LTLCardinality-11
FORMULA ResAllocation-PT-R100C002-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717266253232

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-04
ltl formula formula --ltl=/tmp/4456/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 309 places, 202 transitions and 818 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4456/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4456/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4456/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4456/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 311 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 211 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1702 levels ~10000 states ~29720 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~20000 states ~45780 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~40000 states ~79532 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~80000 states ~157804 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~160000 states ~314536 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~320000 states ~627780 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~640000 states ~1254272 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~1280000 states ~2507844 transitions
pnml2lts-mc( 1/ 4): ~4361 levels ~2560000 states ~6252404 transitions
pnml2lts-mc( 2/ 4): ~1702 levels ~5120000 states ~11354436 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4828663
pnml2lts-mc( 0/ 4): unique states count: 4840698
pnml2lts-mc( 0/ 4): unique transitions count: 14876355
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 10000461
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4840704
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12272
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4840704 states 14876369 transitions, fanout: 3.073
pnml2lts-mc( 0/ 4): Total exploration time 17.270 sec (17.250 sec minimum, 17.263 sec on average)
pnml2lts-mc( 0/ 4): States per second: 280296, Transitions per second: 861399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 101.2MB, 21.8 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 202 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 101.2MB (~256.0MB paged-in)
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-06
ltl formula formula --ltl=/tmp/4456/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 309 places, 202 transitions and 818 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4456/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4456/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4456/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4456/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 933 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~35624 transitions
pnml2lts-mc( 3/ 4): ~3995 levels ~20000 states ~113016 transitions
pnml2lts-mc( 3/ 4): ~3995 levels ~40000 states ~336280 transitions
pnml2lts-mc( 0/ 4): ~3423 levels ~80000 states ~364820 transitions
pnml2lts-mc( 0/ 4): ~3529 levels ~160000 states ~555280 transitions
pnml2lts-mc( 0/ 4): ~3529 levels ~320000 states ~930380 transitions
pnml2lts-mc( 0/ 4): ~3563 levels ~640000 states ~1795232 transitions
pnml2lts-mc( 0/ 4): ~3563 levels ~1280000 states ~3582732 transitions
pnml2lts-mc( 0/ 4): ~3563 levels ~2560000 states ~7365440 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2328844
pnml2lts-mc( 0/ 4): unique states count: 2342878
pnml2lts-mc( 0/ 4): unique transitions count: 20312069
pnml2lts-mc( 0/ 4): - self-loop count: 8
pnml2lts-mc( 0/ 4): - claim dead count: 17832631
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2342886
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14499
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2342886 states 20312093 transitions, fanout: 8.670
pnml2lts-mc( 0/ 4): Total exploration time 10.740 sec (10.700 sec minimum, 10.715 sec on average)
pnml2lts-mc( 0/ 4): States per second: 218146, Transitions per second: 1891256
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 82.2MB, 36.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 202 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.2MB (~256.0MB paged-in)
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-11
ltl formula formula --ltl=/tmp/4456/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 309 places, 202 transitions and 818 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4456/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4456/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4456/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4456/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 311 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 267 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~23032 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~20000 states ~48528 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~40000 states ~121768 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~80000 states ~282876 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~160000 states ~629280 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~320000 states ~1399468 transitions
pnml2lts-mc( 0/ 4): ~3920 levels ~640000 states ~2953444 transitions
pnml2lts-mc( 2/ 4): ~4400 levels ~1280000 states ~4738872 transitions
pnml2lts-mc( 2/ 4): ~4400 levels ~2560000 states ~9999008 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3331827
pnml2lts-mc( 0/ 4): unique states count: 3345546
pnml2lts-mc( 0/ 4): unique transitions count: 16741060
pnml2lts-mc( 0/ 4): - self-loop count: 5
pnml2lts-mc( 0/ 4): - claim dead count: 13364580
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3345554
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3345554 states 16741081 transitions, fanout: 5.004
pnml2lts-mc( 0/ 4): Total exploration time 13.640 sec (13.630 sec minimum, 13.638 sec on average)
pnml2lts-mc( 0/ 4): States per second: 245275, Transitions per second: 1227352
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 89.8MB, 27.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 202 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 89.8MB (~256.0MB paged-in)
ltl formula name ResAllocation-PT-R100C002-LTLCardinality-14
ltl formula formula --ltl=/tmp/4456/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 309 places, 202 transitions and 818 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4456/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4456/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4456/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4456/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 311 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 310, there are 219 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~23360 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~2587!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 665
pnml2lts-mc( 0/ 4): unique states count: 11909
pnml2lts-mc( 0/ 4): unique transitions count: 34049
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 1118
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11920
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11920 states 34080 transitions, fanout: 2.859
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74500, Transitions per second: 213000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 24.5 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 202 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ResAllocation-PT-R100C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662339500883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;