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.r480-tall-171624189800708.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 DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717194873913

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:34:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:34:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:34:35] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-31 22:34:35] [INFO ] Transformed 399 places.
[2024-05-31 22:34:35] [INFO ] Transformed 350 transitions.
[2024-05-31 22:34:35] [INFO ] Found NUPN structural information;
[2024-05-31 22:34:35] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Support contains 48 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 373 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 373 transition count 327
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 362 transition count 316
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 362 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 362 transition count 307
Applied a total of 80 rules in 110 ms. Remains 362 /399 variables (removed 37) and now considering 307/350 (removed 43) transitions.
// Phase 1: matrix 307 rows 362 cols
[2024-05-31 22:34:35] [INFO ] Computed 62 invariants in 41 ms
[2024-05-31 22:34:36] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-31 22:34:36] [INFO ] Invariant cache hit.
[2024-05-31 22:34:36] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-31 22:34:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 307/669 variables, 362/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 32 ms to minimize.
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 17/449 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:34:58] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:34:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:35:00] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:35:00] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-31 22:35:06] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 5 ms to minimize.
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 30256ms
Starting structural reductions in LTL mode, iteration 1 : 362/399 places, 307/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31279 ms. Remains : 362/399 places, 307/350 transitions.
Support contains 48 out of 362 places after structural reductions.
[2024-05-31 22:35:07] [INFO ] Flatten gal took : 48 ms
[2024-05-31 22:35:07] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:35:07] [INFO ] Input system was already deterministic with 307 transitions.
Support contains 46 out of 362 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (343 resets) in 1542 ms. (25 steps per ms) remains 13/33 properties
BEST_FIRST walk for 40003 steps (50 resets) in 274 ms. (145 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (49 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (60 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (59 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (47 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (51 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (45 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (46 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
[2024-05-31 22:35:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 123/172 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 169/341 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/345 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 292/637 variables, 345/407 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 3 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 7/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 20/657 variables, 11/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/657 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 6/663 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:35:10] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/663 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:11] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 4/667 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:35:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/669 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/669 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 440 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 123/172 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 169/341 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 4/345 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 292/637 variables, 345/423 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:14] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:35:15] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:16] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:35:17] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/637 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:18] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:35:18] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/669 variables, and 442 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 345/362 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 22/22 constraints]
After SMT, in 10056ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 355 transition count 286
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 340 transition count 285
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 340 transition count 274
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 329 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 323 transition count 268
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 323 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 323 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 323 transition count 264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 322 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 321 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 321 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 321 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 321 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 320 transition count 261
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 224 place count 247 transition count 188
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 4 with 4 rules applied. Total rules applied 228 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 242 transition count 188
Applied a total of 232 rules in 117 ms. Remains 242 /362 variables (removed 120) and now considering 188/307 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 242/362 places, 188/307 transitions.
RANDOM walk for 40000 steps (1616 resets) in 676 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (336 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (290 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (315 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (300 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (313 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (316 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (300 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (295 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (330 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (294 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (305 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (320 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (310 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 753073 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 13
Probabilistic random walk after 753073 steps, saw 113072 distinct states, run finished after 3005 ms. (steps per millisecond=250 ) properties seen :0
// Phase 1: matrix 188 rows 242 cols
[2024-05-31 22:35:22] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 22:35:22] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 75/108 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 107/215 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 188/404 variables, 216/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:23] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:23] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 26/430 variables, 26/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 311 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 75/108 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 107/215 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 188/404 variables, 216/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 9/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 26/430 variables, 26/320 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:35:27] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:35:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:35:27] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:35:27] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:35:28] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:35:28] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 330 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8151 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 10076ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 17371 ms.
Support contains 17 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 22:35:49] [INFO ] Invariant cache hit.
[2024-05-31 22:35:49] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 22:35:49] [INFO ] Invariant cache hit.
[2024-05-31 22:35:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:35:50] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-31 22:35:50] [INFO ] Redundant transitions in 6 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 22:35:50] [INFO ] Invariant cache hit.
[2024-05-31 22:35:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 188/430 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:35:56] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 309 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10098 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 188/430 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 185/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:36:07] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:36:07] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:36:08] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:36:08] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:36:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 7/501 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:36:25] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 504 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 11/11 constraints]
After SMT, in 40199ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 40205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40593 ms. Remains : 242/242 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 13 properties.
[2024-05-31 22:36:30] [INFO ] Invariant cache hit.
[2024-05-31 22:36:30] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 22:36:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:36:30] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-31 22:36:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:36:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:36:30] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-31 22:36:31] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-31 22:36:31] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:36:31] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2024-05-31 22:36:31] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 2
[2024-05-31 22:36:32] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 3
[2024-05-31 22:36:32] [INFO ] After 1800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-31 22:36:32] [INFO ] After 2238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 2435 ms.
Computed a total of 178 stabilizing places and 170 stable transitions
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 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) U (G((F(p1)&&F(G(!p2)))) U p2)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 14 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 22:36:33] [INFO ] Computed 62 invariants in 15 ms
[2024-05-31 22:36:33] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 22:36:33] [INFO ] Invariant cache hit.
[2024-05-31 22:36:33] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:36:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:36:39] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:36:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:36:39] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:36:41] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:36:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:36:41] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:36:41] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:36:42] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:36:42] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:36:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:36:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:36:46] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:36:47] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:36:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:36:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:36:50] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:36:51] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:36:52] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:36:53] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:36:53] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:36:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:36:53] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:36:59] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:01] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:37:02] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:37:02] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:37:02] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:37:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:05] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:37:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:37:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:37:06] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:08] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:37:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:10] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:37:10] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:37:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:13] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:37:13] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:37:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:37:15] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p0), (NOT p1), p2, (OR (NOT p1) p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-00
Product exploration explored 100000 steps with 2179 reset in 353 ms.
Product exploration explored 100000 steps with 2207 reset in 254 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/353 stabilizing places and 168/293 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 227 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (349 resets) in 304 ms. (131 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (50 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (51 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (51 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2024-05-31 22:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 138/164 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 169/333 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/338 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 280/618 variables, 338/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 18/636 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/642 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/644 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/644 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/646 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 7 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 138/164 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 169/333 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:37:36] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:37:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/338 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 280/618 variables, 338/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 18/636 variables, 10/419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/636 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/636 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 6/642 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/642 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/642 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/644 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/644 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 2/646 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 426 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 3096ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10032 ms.
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 347 transition count 271
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 330 transition count 271
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 330 transition count 260
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 319 transition count 260
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 203 place count 247 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 242 transition count 188
Applied a total of 211 rules in 49 ms. Remains 242 /353 variables (removed 111) and now considering 188/293 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 242/353 places, 188/293 transitions.
RANDOM walk for 40000 steps (1662 resets) in 286 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (291 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (278 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (287 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (291 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (278 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (288 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (306 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 889636 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 7
Probabilistic random walk after 889636 steps, saw 125296 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
// Phase 1: matrix 188 rows 242 cols
[2024-05-31 22:37:52] [INFO ] Computed 60 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 54/70 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/198 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/208 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/397 variables, 209/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 33/430 variables, 33/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 7 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 54/70 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/198 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/208 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/397 variables, 209/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 33/430 variables, 33/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1138ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2556 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 22:37:56] [INFO ] Invariant cache hit.
[2024-05-31 22:37:56] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 22:37:56] [INFO ] Invariant cache hit.
[2024-05-31 22:37:56] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-31 22:37:56] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 22:37:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 2/240 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 188/430 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:38:00] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:38:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 307 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10448 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 2/240 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 2/242 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 188/430 variables, 242/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 184/491 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:38:14] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:38:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:38:16] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:38:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:38:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 5/496 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:38:29] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 40532ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 40534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40938 ms. Remains : 242/242 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-31 22:38:37] [INFO ] Invariant cache hit.
[2024-05-31 22:38:37] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:38:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 22:38:37] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 22:38:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 22:38:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:38:37] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-31 22:38:37] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-05-31 22:38:37] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-31 22:38:37] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 929 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 327 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 22:38:38] [INFO ] Computed 62 invariants in 5 ms
[2024-05-31 22:38:38] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-31 22:38:38] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2024-05-31 22:38:39] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2024-05-31 22:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:38:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-31 22:38:40] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-31 22:38:42] [INFO ] [Nat]Absence check using state equation in 2366 ms returned sat
[2024-05-31 22:38:42] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:38:42] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:38:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2024-05-31 22:38:43] [INFO ] Computed and/alt/rep : 287/602/287 causal constraints (skipped 5 transitions) in 21 ms.
[2024-05-31 22:38:46] [INFO ] Added : 201 causal constraints over 41 iterations in 3001 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 346 transition count 274
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 331 transition count 274
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 331 transition count 263
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 320 transition count 263
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 197 place count 248 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 243 transition count 191
Applied a total of 204 rules in 40 ms. Remains 243 /353 variables (removed 110) and now considering 191/293 (removed 102) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-31 22:38:46] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:38:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 22:38:46] [INFO ] Invariant cache hit.
[2024-05-31 22:38:46] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-31 22:38:46] [INFO ] Redundant transitions in 7 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 22:38:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:38:51] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:38:52] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:38:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:38:57] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:38:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:39:02] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:39:02] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:39:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:39:03] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:39:03] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21845 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:39:18] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:39:18] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 51939ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 243/353 places, 191/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52372 ms. Remains : 243/353 places, 191/293 transitions.
Computed a total of 138 stabilizing places and 133 stable transitions
Computed a total of 138 stabilizing places and 133 stable transitions
Detected a total of 138/243 stabilizing places and 133/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 789 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (1841 resets) in 498 ms. (80 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (326 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (326 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (326 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (325 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (324 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (324 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (330 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
[2024-05-31 22:39:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 44/60 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/188 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/198 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/393 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 41/434 variables, 38/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/434 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 301 constraints, problems are : Problem set: 0 solved, 7 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 44/60 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/188 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:39:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 10/198 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 7/205 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 188/393 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 41/434 variables, 38/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/434 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1240ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6324 ms.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 242 transition count 189
Applied a total of 3 rules in 14 ms. Remains 242 /243 variables (removed 1) and now considering 189/191 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 242/243 places, 189/191 transitions.
RANDOM walk for 40000 steps (1806 resets) in 575 ms. (69 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (306 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (320 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (312 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (288 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (293 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (328 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 687386 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 7
Probabilistic random walk after 687386 steps, saw 90253 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 189 rows 242 cols
[2024-05-31 22:39:51] [INFO ] Computed 59 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 50/66 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/194 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/204 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/205 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 186/391 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 40/431 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 301 constraints, problems are : Problem set: 0 solved, 7 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 50/66 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/194 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/204 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/205 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 186/391 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 40/431 variables, 37/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:39:52] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 313 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1755ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 11580 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 242/242 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-31 22:40:04] [INFO ] Invariant cache hit.
[2024-05-31 22:40:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-31 22:40:04] [INFO ] Invariant cache hit.
[2024-05-31 22:40:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-31 22:40:04] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 22:40:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/240 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 189/431 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:40:09] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:40:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/431 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 305 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9681 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/240 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 2/242 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 189/431 variables, 242/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 185/490 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:40:20] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:40:21] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:40:21] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:40:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 494 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints]
After SMT, in 39759ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 39761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40147 ms. Remains : 242/242 places, 189/189 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-31 22:40:44] [INFO ] Invariant cache hit.
[2024-05-31 22:40:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:40:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:40:44] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 22:40:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:40:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:40:45] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-31 22:40:45] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 22:40:45] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-05-31 22:40:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 2
[2024-05-31 22:40:45] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 3
[2024-05-31 22:40:45] [INFO ] After 1053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-31 22:40:46] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1403 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 887 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 191 rows 243 cols
[2024-05-31 22:40:47] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:40:47] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-31 22:40:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 22:40:47] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-05-31 22:40:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:40:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-31 22:40:48] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 22:40:48] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-05-31 22:40:48] [INFO ] Computed and/alt/rep : 176/425/176 causal constraints (skipped 11 transitions) in 12 ms.
[2024-05-31 22:40:49] [INFO ] Added : 126 causal constraints over 26 iterations in 575 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 13187 reset in 241 ms.
Product exploration explored 100000 steps with 13196 reset in 264 ms.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 191/191 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 22:40:49] [INFO ] Invariant cache hit.
[2024-05-31 22:40:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 22:40:50] [INFO ] Invariant cache hit.
[2024-05-31 22:40:50] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-31 22:40:50] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 22:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:40:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:40:56] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:40:59] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:41:00] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:41:00] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:41:05] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21731 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 51809ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51812ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52228 ms. Remains : 243/243 places, 191/191 transitions.
Treatment of property DES-PT-30b-LTLFireability-00 finished in 309256 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(X(X((!p0 U p1))))) U (G(p0) U p2)))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 354 transition count 294
Applied a total of 21 rules in 15 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-31 22:41:42] [INFO ] Computed 62 invariants in 2 ms
[2024-05-31 22:41:42] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 22:41:42] [INFO ] Invariant cache hit.
[2024-05-31 22:41:42] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 22:41:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:41:48] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:41:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:41:48] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:41:49] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:41:49] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:41:49] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:41:50] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:41:50] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 12/428 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:41:55] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 11/439 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:41:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:41:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:41:59] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-05-31 22:42:00] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:42:00] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 11/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:02] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:42:03] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 468 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 22:42:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 294/648 variables, 354/481 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 293/774 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 774 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 65/65 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 540 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-01
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-01 finished in 61202 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 U X(X(X(!p0)))))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 15 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 22:42:43] [INFO ] Computed 62 invariants in 6 ms
[2024-05-31 22:42:43] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 22:42:43] [INFO ] Invariant cache hit.
[2024-05-31 22:42:44] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:42:49] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:42:52] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:52] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:42:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 313 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : DES-PT-30b-LTLFireability-02
Product exploration explored 100000 steps with 872 reset in 275 ms.
Product exploration explored 100000 steps with 873 reset in 204 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 1079 steps (9 resets) in 24 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 292 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-31 22:43:46] [INFO ] Invariant cache hit.
[2024-05-31 22:43:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 22:43:46] [INFO ] Invariant cache hit.
[2024-05-31 22:43:46] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:43:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:43:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:43:55] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:43:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:43:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:43:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:43:59] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:44:00] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:02] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:44:03] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:44:05] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:44:06] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:44:06] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:44:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:44:06] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:12] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:44:14] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:44:15] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:44:15] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:44:15] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:18] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:44:18] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:44:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:23] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:44:23] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:44:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 353/353 places, 293/293 transitions.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 839 steps (6 resets) in 14 ms. (55 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 272 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 339 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 873 reset in 181 ms.
Product exploration explored 100000 steps with 861 reset in 203 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-31 22:44:48] [INFO ] Invariant cache hit.
[2024-05-31 22:44:49] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-31 22:44:49] [INFO ] Invariant cache hit.
[2024-05-31 22:44:49] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:44:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:57] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:44:57] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:44:57] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:44:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:45:06] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:45:08] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:45:17] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:45:22] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:45:22] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:45:22] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:45:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:45:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:45:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:28] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:45:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:45:30] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:45:30] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 353/353 places, 293/293 transitions.
Treatment of property DES-PT-30b-LTLFireability-02 finished in 186152 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(((p1&&G(F(p2)))||p0)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 220 place count 247 transition count 190
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 4 with 4 rules applied. Total rules applied 224 place count 245 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 243 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 242 transition count 190
Applied a total of 227 rules in 63 ms. Remains 242 /362 variables (removed 120) and now considering 190/307 (removed 117) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-31 22:45:49] [INFO ] Computed 58 invariants in 2 ms
[2024-05-31 22:45:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 22:45:49] [INFO ] Invariant cache hit.
[2024-05-31 22:45:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:45:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-31 22:45:50] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 22:45:50] [INFO ] Invariant cache hit.
[2024-05-31 22:45:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:45:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:45:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:45:58] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:46:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:46:07] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 21381 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:46:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:46:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:46:35] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 51465ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 51467ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 190/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51950 ms. Remains : 242/362 places, 190/307 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-03
Product exploration explored 100000 steps with 4238 reset in 250 ms.
Product exploration explored 100000 steps with 4267 reset in 270 ms.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 14 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1677 resets) in 296 ms. (134 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (348 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (285 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (330 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
[2024-05-31 22:46:42] [INFO ] Invariant cache hit.
[2024-05-31 22:46:42] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/23 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/370 variables, 7/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/402 variables, 2/275 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/432 variables, 30/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 306 constraints, problems are : Problem set: 1 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 22:46:43] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:46:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/370 variables, 7/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/402 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 30/432 variables, 30/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 1 solved, 2 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 733ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 513 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 189
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 34 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 239/242 places, 186/190 transitions.
RANDOM walk for 40000 steps (1843 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (341 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (366 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 859887 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 2
Probabilistic random walk after 859887 steps, saw 116135 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
// Phase 1: matrix 186 rows 239 cols
[2024-05-31 22:46:47] [INFO ] Computed 59 invariants in 6 ms
[2024-05-31 22:46:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 29/425 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 304 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 29/425 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 613 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 22:46:48] [INFO ] Invariant cache hit.
[2024-05-31 22:46:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 22:46:48] [INFO ] Invariant cache hit.
[2024-05-31 22:46:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:46:49] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-31 22:46:49] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 22:46:49] [INFO ] Invariant cache hit.
[2024-05-31 22:46:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/424 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:46:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:46:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:46:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:46:56] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:46:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 1/425 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:47:01] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:47:01] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:47:01] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 312 constraints, problems are : Problem set: 0 solved, 182 unsolved in 16586 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:47:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 186/424 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 182/494 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:47:18] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:47:19] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:47:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 497 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 12/12 constraints]
After SMT, in 46670ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 46672ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47103 ms. Remains : 239/239 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Applied a total of 1 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-31 22:47:35] [INFO ] Computed 59 invariants in 2 ms
[2024-05-31 22:47:35] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:47:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:47:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:47:36] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:47:36] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:47:36] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 531 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 17 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-31 22:47:37] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 22:47:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 22:47:37] [INFO ] Invariant cache hit.
[2024-05-31 22:47:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:47:37] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-31 22:47:37] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 22:47:37] [INFO ] Invariant cache hit.
[2024-05-31 22:47:37] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:47:42] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:47:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:47:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:47:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:47:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:47:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:47:54] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 21602 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:48:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:48:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:48:22] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 51677ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 51681ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52124 ms. Remains : 242/242 places, 190/190 transitions.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 14 factoid took 369 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1693 resets) in 723 ms. (55 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (342 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (298 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (345 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2024-05-31 22:48:29] [INFO ] Invariant cache hit.
[2024-05-31 22:48:29] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/23 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/370 variables, 7/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/402 variables, 2/275 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/432 variables, 30/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 306 constraints, problems are : Problem set: 1 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 22:48:30] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:48:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/370 variables, 7/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/402 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 30/432 variables, 30/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 1 solved, 2 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 762ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 402 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 189
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 34 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 239/242 places, 186/190 transitions.
RANDOM walk for 40000 steps (1805 resets) in 465 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (367 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (384 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 829103 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 2
Probabilistic random walk after 829103 steps, saw 112361 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
// Phase 1: matrix 186 rows 239 cols
[2024-05-31 22:48:34] [INFO ] Computed 59 invariants in 5 ms
[2024-05-31 22:48:34] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 29/425 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 304 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 29/425 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 526 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 22:48:35] [INFO ] Invariant cache hit.
[2024-05-31 22:48:35] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 22:48:35] [INFO ] Invariant cache hit.
[2024-05-31 22:48:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:48:35] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-31 22:48:35] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 22:48:35] [INFO ] Invariant cache hit.
[2024-05-31 22:48:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/424 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:48:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:48:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:48:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:48:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:48:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 1/425 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 312 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17089 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:48:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 186/424 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 182/494 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:49:06] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:49:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:49:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 497 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 12/12 constraints]
After SMT, in 47169ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 47171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47599 ms. Remains : 239/239 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Applied a total of 1 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-31 22:49:23] [INFO ] Computed 59 invariants in 5 ms
[2024-05-31 22:49:23] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:49:23] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:49:23] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:49:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-31 22:49:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 22:49:23] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:49:23] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:49:23] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 324 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 593 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4253 reset in 242 ms.
Product exploration explored 100000 steps with 4261 reset in 265 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-31 22:49:24] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:49:25] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 22:49:25] [INFO ] Invariant cache hit.
[2024-05-31 22:49:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:49:25] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-31 22:49:25] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 22:49:25] [INFO ] Invariant cache hit.
[2024-05-31 22:49:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:49:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:49:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:49:35] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:49:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:49:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 22093 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:49:48] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 22:50:11] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 52185ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 52187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52615 ms. Remains : 242/242 places, 190/190 transitions.
Treatment of property DES-PT-30b-LTLFireability-03 finished in 267936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 226 place count 244 transition count 187
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 4 with 4 rules applied. Total rules applied 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 43 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:50:17] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:50:17] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 22:50:17] [INFO ] Invariant cache hit.
[2024-05-31 22:50:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:50:18] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-31 22:50:18] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 22:50:18] [INFO ] Invariant cache hit.
[2024-05-31 22:50:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:50:23] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:50:27] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:50:28] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:50:32] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18376 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:50:43] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:50:49] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 48451ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48948 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-04
Product exploration explored 100000 steps with 4961 reset in 204 ms.
Product exploration explored 100000 steps with 4924 reset in 230 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1975 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (374 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1616210 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1616210 steps, saw 221277 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
[2024-05-31 22:51:10] [INFO ] Invariant cache hit.
[2024-05-31 22:51:10] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 10 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1906 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (398 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1614081 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :0 out of 1
Probabilistic random walk after 1614081 steps, saw 220896 distinct states, run finished after 3001 ms. (steps per millisecond=537 ) properties seen :0
// Phase 1: matrix 185 rows 238 cols
[2024-05-31 22:51:13] [INFO ] Computed 59 invariants in 5 ms
[2024-05-31 22:51:13] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:51:14] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/200 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 153/353 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-31 22:51:14] [INFO ] Invariant cache hit.
[2024-05-31 22:51:14] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-31 22:51:14] [INFO ] Invariant cache hit.
[2024-05-31 22:51:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:51:14] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-31 22:51:14] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 22:51:14] [INFO ] Invariant cache hit.
[2024-05-31 22:51:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:51:20] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:51:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:51:21] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:51:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:51:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14962 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 185/422 variables, 237/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 182/491 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:51:36] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 45034ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45423 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-31 22:51:59] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 22:51:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:51:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:51:59] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:51:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:51:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 22:52:00] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:52:00] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:52:00] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 265 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:52:00] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:52:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-31 22:52:00] [INFO ] Invariant cache hit.
[2024-05-31 22:52:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:52:00] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-31 22:52:00] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 22:52:00] [INFO ] Invariant cache hit.
[2024-05-31 22:52:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:52:06] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:52:10] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:52:11] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18786 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:52:26] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:52:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 48866ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48869ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49329 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1955 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (399 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1591737 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1591737 steps, saw 217580 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
[2024-05-31 22:52:52] [INFO ] Invariant cache hit.
[2024-05-31 22:52:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 10 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1879 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (388 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1534752 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 1
Probabilistic random walk after 1534752 steps, saw 209562 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
// Phase 1: matrix 185 rows 238 cols
[2024-05-31 22:52:56] [INFO ] Computed 59 invariants in 5 ms
[2024-05-31 22:52:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:52:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/200 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 153/353 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-31 22:52:57] [INFO ] Invariant cache hit.
[2024-05-31 22:52:57] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 22:52:57] [INFO ] Invariant cache hit.
[2024-05-31 22:52:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:52:57] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-31 22:52:57] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-31 22:52:57] [INFO ] Invariant cache hit.
[2024-05-31 22:52:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:53:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:53:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:53:04] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:53:04] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:53:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 182 unsolved in 15189 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 185/422 variables, 237/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 182/491 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-31 22:53:19] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 45270ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45687 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-31 22:53:42] [INFO ] Computed 59 invariants in 1 ms
[2024-05-31 22:53:42] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-31 22:53:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:53:42] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:53:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-31 22:53:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:53:42] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:53:42] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:53:42] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 268 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4888 reset in 207 ms.
Product exploration explored 100000 steps with 4873 reset in 232 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:53:43] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 22:53:43] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 22:53:43] [INFO ] Invariant cache hit.
[2024-05-31 22:53:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 22:53:44] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-31 22:53:44] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 22:53:44] [INFO ] Invariant cache hit.
[2024-05-31 22:53:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18632 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
SMT process timed out in 48710ms, After SMT, problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49164 ms. Remains : 239/239 places, 187/187 transitions.
Treatment of property DES-PT-30b-LTLFireability-04 finished in 255260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(p1)))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 15 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 22:54:32] [INFO ] Computed 62 invariants in 4 ms
[2024-05-31 22:54:32] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 22:54:32] [INFO ] Invariant cache hit.
[2024-05-31 22:54:33] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:54:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-05
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-05 finished in 60878 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 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 287
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 339 transition count 275
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 328 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 322 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 322 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 320 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 320 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 320 transition count 262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 319 transition count 262
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 226 place count 244 transition count 187
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 4 with 4 rules applied. Total rules applied 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 36 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:55:33] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:55:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-31 22:55:33] [INFO ] Invariant cache hit.
[2024-05-31 22:55:34] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-31 22:55:34] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 22:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/426 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:55:43] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:55:43] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:55:43] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:55:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 184 unsolved in 16248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 2/239 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/426 variables, 239/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 184/489 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:55:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 491 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints]
After SMT, in 46345ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 46347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46765 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-06
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-06 finished in 46849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 16 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 22:56:20] [INFO ] Computed 62 invariants in 8 ms
[2024-05-31 22:56:20] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 22:56:20] [INFO ] Invariant cache hit.
[2024-05-31 22:56:21] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 22:56:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:56:29] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:56:29] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:56:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:56:38] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:39] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:56:39] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:56:40] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:56:40] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:56:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:56:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:47] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:48] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:56:49] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:56:50] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:56:50] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:56:50] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:56:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:56:58] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:56:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:56:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:57:00] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:57:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:57:03] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60712 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-07 finished in 60872 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 U p1) U X((G(!p0)&&F(p2)))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 325 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 325 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 325 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 325 transition count 269
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 324 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 323 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 323 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 219 place count 247 transition count 191
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 4 with 4 rules applied. Total rules applied 223 place count 245 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 243 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 242 transition count 191
Applied a total of 226 rules in 36 ms. Remains 242 /362 variables (removed 120) and now considering 191/307 (removed 116) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-31 22:57:21] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 22:57:21] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-31 22:57:21] [INFO ] Invariant cache hit.
[2024-05-31 22:57:21] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-31 22:57:21] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 22:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/241 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/432 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:57:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/433 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:57:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:57:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:57:32] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:57:35] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (OVERLAPS) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18168 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 1/239 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/432 variables, 241/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 187/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 492 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 48250ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 191/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48687 ms. Remains : 242/362 places, 191/307 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), false, (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-08
Product exploration explored 100000 steps with 5001 reset in 259 ms.
Product exploration explored 100000 steps with 4956 reset in 289 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 161 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1887 resets) in 289 ms. (137 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (339 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (347 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2024-05-31 22:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/370 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 33/403 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/433 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/370 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/403 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/433 variables, 30/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 920 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 12 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 239/242 places, 187/191 transitions.
RANDOM walk for 40000 steps (1897 resets) in 474 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (349 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (360 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 911505 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 2
Probabilistic random walk after 911505 steps, saw 123817 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:58:16] [INFO ] Computed 59 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/364 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 33/397 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 29/426 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/364 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 33/397 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 29/426 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 982 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-31 22:58:18] [INFO ] Invariant cache hit.
[2024-05-31 22:58:18] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 22:58:18] [INFO ] Invariant cache hit.
[2024-05-31 22:58:18] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-31 22:58:18] [INFO ] Redundant transitions in 1 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-31 22:58:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/237 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/238 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 22:58:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:58:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 22:58:25] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:58:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:58:25] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 1/426 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 22:58:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 183 unsolved in 18261 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 2/237 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 183/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
After SMT, in 48357ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 48359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48748 ms. Remains : 239/239 places, 187/187 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 187
Applied a total of 1 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 22:59:06] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 22:59:06] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:59:06] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 22:59:06] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:59:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:59:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 22:59:07] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:59:07] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:59:07] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 17 factoid took 493 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-31 22:59:08] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 22:59:08] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 22:59:08] [INFO ] Invariant cache hit.
[2024-05-31 22:59:08] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-31 22:59:08] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 22:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/241 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/432 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:59:14] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/433 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:59:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:59:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:59:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 22:59:23] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (OVERLAPS) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18552 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 1/239 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/432 variables, 241/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 187/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 492 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 48638ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49035 ms. Remains : 242/242 places, 191/191 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 144 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1954 resets) in 589 ms. (67 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (373 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (359 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2024-05-31 22:59:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/370 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 33/403 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/433 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/370 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/403 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/433 variables, 30/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 730 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 10 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 239/242 places, 187/191 transitions.
RANDOM walk for 40000 steps (1874 resets) in 444 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (349 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (357 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 865209 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :0 out of 2
Probabilistic random walk after 865209 steps, saw 118795 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 23:00:02] [INFO ] Computed 59 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/364 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 33/397 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 29/426 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/364 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 33/397 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 29/426 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 820 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-31 23:00:04] [INFO ] Invariant cache hit.
[2024-05-31 23:00:04] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 23:00:04] [INFO ] Invariant cache hit.
[2024-05-31 23:00:04] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-31 23:00:04] [INFO ] Redundant transitions in 0 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-31 23:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/237 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/238 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:00:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-31 23:00:09] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:00:11] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:00:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-31 23:00:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 1/426 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:00:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:00:18] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 183 unsolved in 17891 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 2/237 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 183/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
After SMT, in 47970ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 47972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48354 ms. Remains : 239/239 places, 187/187 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 187
Applied a total of 1 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-31 23:00:52] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 23:00:52] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:00:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:00:52] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:00:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:00:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:00:52] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:00:53] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:00:53] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 358 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 21 factoid took 443 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 4891 reset in 282 ms.
Product exploration explored 100000 steps with 4969 reset in 323 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-31 23:00:55] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 23:00:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-31 23:00:55] [INFO ] Invariant cache hit.
[2024-05-31 23:00:55] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-31 23:00:55] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-31 23:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/241 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/432 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:01:01] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/433 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:01:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:01:05] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:01:06] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:01:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (OVERLAPS) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18782 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 1/239 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/432 variables, 241/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 187/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 492 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 48861ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48863ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49277 ms. Remains : 242/242 places, 191/191 transitions.
Treatment of property DES-PT-30b-LTLFireability-08 finished in 263210 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((p0||(F(p0)&&p1)))||X(F(p2))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 15 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-31 23:01:44] [INFO ] Computed 62 invariants in 6 ms
[2024-05-31 23:01:44] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 23:01:44] [INFO ] Invariant cache hit.
[2024-05-31 23:01:45] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 23:01:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:01:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:01:52] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:01:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:01:52] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:01:52] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:01:52] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:01:53] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:01:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:01:53] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 11/427 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:01:55] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:01:56] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:01:56] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:01:57] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:01:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 10/437 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:02:01] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:02:01] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:02:01] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:02:03] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:02:03] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:02:04] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:02:05] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:02:05] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:02:05] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 6/446 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:02:09] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:02:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:02:09] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:02:13] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:02:15] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30801 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-09
Stuttering criterion allowed to conclude after 260 steps with 1 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-09 finished in 30988 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 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 12 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 23:02:15] [INFO ] Computed 62 invariants in 8 ms
[2024-05-31 23:02:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 23:02:15] [INFO ] Invariant cache hit.
[2024-05-31 23:02:16] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 23:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:02:22] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:02:23] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:02:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:02:24] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:02:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:02:29] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:02:33] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:34] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:02:35] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:02:36] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:42] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:43] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:02:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-31 23:02:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:55] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:02:56] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:02:57] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 88 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-10 finished in 60818 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((X(p0)&&(p1||X(p2)))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 354 transition count 294
Applied a total of 21 rules in 23 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-31 23:03:16] [INFO ] Computed 62 invariants in 9 ms
[2024-05-31 23:03:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 23:03:16] [INFO ] Invariant cache hit.
[2024-05-31 23:03:17] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 23:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:22] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:03:22] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:03:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:03:25] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 10/426 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:30] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:03:30] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:03:30] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:03:33] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:03:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:03:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:36] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:03:36] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-31 23:03:37] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 12/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:03:46] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 452 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 36/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:03:49] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:03:50] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-31 23:03:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-31 23:03:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:03:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:03:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:03:52] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:03:52] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:03:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 294/648 variables, 354/476 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 293/769 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:04:14] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 772 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 63/63 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-30b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-11 finished in 60912 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&&G(p1))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 16 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-31 23:04:17] [INFO ] Computed 62 invariants in 6 ms
[2024-05-31 23:04:17] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 23:04:17] [INFO ] Invariant cache hit.
[2024-05-31 23:04:17] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-31 23:04:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:23] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:04:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:04:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:04:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:30] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:04:31] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:04:31] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:04:31] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:04:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:04:36] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:44] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:04:46] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:04:46] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:04:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:04:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:49] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:52] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:04:55] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:04:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:04:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:04:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:04:59] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-12 finished in 60771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 340 transition count 288
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 340 transition count 278
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 330 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 324 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 324 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 324 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 324 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 323 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 322 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 322 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 321 transition count 265
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 225 place count 244 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 243 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 241 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 240 transition count 186
Applied a total of 230 rules in 40 ms. Remains 240 /362 variables (removed 122) and now considering 186/307 (removed 121) transitions.
// Phase 1: matrix 186 rows 240 cols
[2024-05-31 23:05:18] [INFO ] Computed 58 invariants in 3 ms
[2024-05-31 23:05:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-31 23:05:18] [INFO ] Invariant cache hit.
[2024-05-31 23:05:18] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-31 23:05:18] [INFO ] Redundant transitions in 0 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-31 23:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 186/425 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 183 unsolved in 9914 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 186/425 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 183/480 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:05:35] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-31 23:05:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:05:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:05:39] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:05:39] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:05:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 23:05:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 8/8 constraints]
After SMT, in 40000ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 40002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 240/362 places, 186/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40455 ms. Remains : 240/362 places, 186/307 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-13 finished in 40506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1)&&X(F(p2)))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 16 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-31 23:05:58] [INFO ] Computed 62 invariants in 7 ms
[2024-05-31 23:05:58] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 23:05:58] [INFO ] Invariant cache hit.
[2024-05-31 23:05:59] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 23:05:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:06:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 14/430 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:06:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:06:14] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:06:14] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:06:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 10/448 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:06:19] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:06:19] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:06:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:06:23] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 7/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:29] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 461 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 45/107 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:06:32] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 17/124 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:34] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:06:35] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:40] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:06:41] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 12 (OVERLAPS) 295/649 variables, 354/488 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 294/782 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 782 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 72/72 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-14
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-14 finished in 60936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Applied a total of 18 rules in 11 ms. Remains 355 /362 variables (removed 7) and now considering 296/307 (removed 11) transitions.
// Phase 1: matrix 296 rows 355 cols
[2024-05-31 23:06:59] [INFO ] Computed 62 invariants in 5 ms
[2024-05-31 23:06:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 23:06:59] [INFO ] Invariant cache hit.
[2024-05-31 23:07:00] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/651 variables, 355/417 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:07:07] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:07:07] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:10] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:07:10] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:10] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:11] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:14] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-31 23:07:14] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 10/441 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-31 23:07:19] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:07:20] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (OVERLAPS) 0/651 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 451 constraints, problems are : Problem set: 0 solved, 295 unsolved in 29217 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:07:34] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-31 23:07:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 296/651 variables, 355/479 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 295/774 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:52] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 779 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 67/67 constraints]
After SMT, in 59318ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 59321ms
Starting structural reductions in LTL mode, iteration 1 : 355/362 places, 296/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59888 ms. Remains : 355/362 places, 296/307 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-15
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-15 finished in 59966 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) U (G((F(p1)&&F(G(!p2)))) U p2)))'
Found a Lengthening insensitive property : DES-PT-30b-LTLFireability-00
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p0), (NOT p1), p2, (OR (NOT p1) p2), (NOT p2)]
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 287
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 286
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 339 transition count 276
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 218 place count 248 transition count 191
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 4 with 4 rules applied. Total rules applied 222 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 243 transition count 191
Applied a total of 225 rules in 37 ms. Remains 243 /362 variables (removed 119) and now considering 191/307 (removed 116) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-31 23:07:59] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 23:08:00] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-31 23:08:00] [INFO ] Invariant cache hit.
[2024-05-31 23:08:00] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-31 23:08:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:15] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:15] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:08:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 20847 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 50926ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 50928ms
Starting structural reductions in LI_LTL mode, iteration 1 : 243/362 places, 191/307 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51366 ms. Remains : 243/362 places, 191/307 transitions.
Running random walk in product with property : DES-PT-30b-LTLFireability-00
Stuttering criterion allowed to conclude after 11741 steps with 839 reset in 28 ms.
Treatment of property DES-PT-30b-LTLFireability-00 finished in 51754 ms.
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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 U X(X(X(!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(((p1&&G(F(p2)))||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)))'
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 U p1) U X((G(!p0)&&F(p2)))))))'
[2024-05-31 23:08:51] [INFO ] Flatten gal took : 19 ms
[2024-05-31 23:08:51] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:08:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 362 places, 307 transitions and 1035 arcs took 3 ms.
Total runtime 2056583 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DES-PT-30b-LTLFireability-04
FORMULA DES-PT-30b-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717197767899

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DES-PT-30b-LTLFireability-00
ltl formula formula --ltl=/tmp/6032/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 362 places, 307 transitions and 1035 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/6032/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6032/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6032/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6032/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 363, there are 369 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~85!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 351
pnml2lts-mc( 0/ 4): unique transitions count: 5685
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 361
pnml2lts-mc( 0/ 4): - cum. max stack depth: 361
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 361 states 5785 transitions, fanout: 16.025
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18050, Transitions per second: 289250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 21.3 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 310 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DES-PT-30b-LTLFireability-02
ltl formula formula --ltl=/tmp/6032/ltl_1_
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 362 places, 307 transitions and 1035 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.040 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6032/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6032/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6032/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6032/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 363, there are 352 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~111 levels ~10000 states ~36980 transitions
pnml2lts-mc( 3/ 4): ~120 levels ~20000 states ~119684 transitions
pnml2lts-mc( 3/ 4): ~120 levels ~40000 states ~259508 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~80000 states ~356480 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~160000 states ~779992 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~320000 states ~1718340 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~640000 states ~3601280 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~1280000 states ~7806564 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~2560000 states ~15959452 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~5120000 states ~35219584 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~10240000 states ~71573128 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~20480000 states ~151463272 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551941
pnml2lts-mc( 0/ 4): unique states count: 33552448
pnml2lts-mc( 0/ 4): unique transitions count: 311534930
pnml2lts-mc( 0/ 4): - self-loop count: 1959
pnml2lts-mc( 0/ 4): - claim dead count: 277979507
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553025
pnml2lts-mc( 0/ 4): - cum. max stack depth: 612
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553025 states 311541560 transitions, fanout: 9.285
pnml2lts-mc( 0/ 4): Total exploration time 203.410 sec (203.400 sec minimum, 203.405 sec on average)
pnml2lts-mc( 0/ 4): States per second: 164953, Transitions per second: 1531594
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 282.8MB, 8.8 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/41.0%
pnml2lts-mc( 0/ 4): Stored 310 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 282.8MB (~256.0MB paged-in)
ltl formula name DES-PT-30b-LTLFireability-03
ltl formula formula --ltl=/tmp/6032/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 362 places, 307 transitions and 1035 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6032/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6032/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6032/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6032/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 364 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 363, there are 328 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): ~96 levels ~10000 states ~125880 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~20000 states ~260296 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~40000 states ~519976 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~80000 states ~1078960 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~160000 states ~2475700 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~320000 states ~5085232 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~640000 states ~11013388 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~1280000 states ~23836348 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~2560000 states ~48310664 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~5120000 states ~99592032 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~10240000 states ~209315312 transitions
pnml2lts-mc( 0/ 4): ~135 levels ~20480000 states ~421138340 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552414
pnml2lts-mc( 0/ 4): unique states count: 33552806
pnml2lts-mc( 0/ 4): unique transitions count: 835319744
pnml2lts-mc( 0/ 4): - self-loop count: 1593
pnml2lts-mc( 0/ 4): - claim dead count: 801758333
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552818
pnml2lts-mc( 0/ 4): - cum. max stack depth: 513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552818 states 835319830 transitions, fanout: 24.896
pnml2lts-mc( 0/ 4): Total exploration time 272.270 sec (272.180 sec minimum, 272.205 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123234, Transitions per second: 3067984
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 310.8MB, 9.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/85.0%
pnml2lts-mc( 0/ 4): Stored 310 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 310.8MB (~256.0MB paged-in)
ltl formula name DES-PT-30b-LTLFireability-04
ltl formula formula --ltl=/tmp/6032/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 362 places, 307 transitions and 1035 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.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6032/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6032/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6032/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6032/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 363, there are 317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~87 levels ~10000 states ~72368 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~20000 states ~158032 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~40000 states ~354552 transitions
pnml2lts-mc( 1/ 4): ~110 levels ~80000 states ~775456 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~160000 states ~1632352 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~320000 states ~3511448 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~640000 states ~7662808 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~1280000 states ~16010888 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~2560000 states ~34324800 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~5120000 states ~64809744 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~10240000 states ~140285144 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~20480000 states ~280532528 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19668871
pnml2lts-mc( 0/ 4): unique states count: 19669388
pnml2lts-mc( 0/ 4): unique transitions count: 283978299
pnml2lts-mc( 0/ 4): - self-loop count: 198
pnml2lts-mc( 0/ 4): - claim dead count: 264304243
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19669397
pnml2lts-mc( 0/ 4): - cum. max stack depth: 620
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19669397 states 283978333 transitions, fanout: 14.438
pnml2lts-mc( 0/ 4): Total exploration time 138.190 sec (138.170 sec minimum, 138.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 142336, Transitions per second: 2054985
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 214.1MB, 11.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 58.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 310 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 214.1MB (~256.0MB paged-in)
ltl formula name DES-PT-30b-LTLFireability-08
ltl formula formula --ltl=/tmp/6032/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 362 places, 307 transitions and 1035 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.040 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6032/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6032/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6032/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6032/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 363, there are 445 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): ~91 levels ~10000 states ~41284 transitions
pnml2lts-mc( 3/ 4): ~91 levels ~20000 states ~84420 transitions
pnml2lts-mc( 3/ 4): ~98 levels ~40000 states ~170532 transitions
pnml2lts-mc( 3/ 4): ~99 levels ~80000 states ~365504 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~160000 states ~843576 transitions
pnml2lts-mc( 3/ 4): ~101 levels ~320000 states ~1662312 transitions
pnml2lts-mc( 1/ 4): ~121 levels ~640000 states ~3793060 transitions
pnml2lts-mc( 1/ 4): ~146 levels ~1280000 states ~7402384 transitions
pnml2lts-mc( 1/ 4): ~161 levels ~2560000 states ~15095392 transitions
pnml2lts-mc( 1/ 4): ~161 levels ~5120000 states ~33119640 transitions
pnml2lts-mc( 1/ 4): ~161 levels ~10240000 states ~68863296 transitions
pnml2lts-mc( 1/ 4): ~161 levels ~20480000 states ~149138328 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33541817
pnml2lts-mc( 0/ 4): unique states count: 33544280
pnml2lts-mc( 0/ 4): unique transitions count: 397175569
pnml2lts-mc( 0/ 4): - self-loop count: 3353
pnml2lts-mc( 0/ 4): - claim dead count: 363616085
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33544291
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2566
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33544291 states 397175631 transitions, fanout: 11.840
pnml2lts-mc( 0/ 4): Total exploration time 220.450 sec (220.420 sec minimum, 220.428 sec on average)
pnml2lts-mc( 0/ 4): States per second: 152163, Transitions per second: 1801658
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 282.4MB, 8.8 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/41.0%
pnml2lts-mc( 0/ 4): Stored 310 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 282.4MB (~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="DES-PT-30b"
export BK_EXAMINATION="LTLFireability"
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 DES-PT-30b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189800708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;