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.r092-tall-171624189900724.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 itstools
Input is DES-PT-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 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 115K 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-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716355135192

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 05:18:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 05:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:18:56] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-22 05:18:56] [INFO ] Transformed 439 places.
[2024-05-22 05:18:56] [INFO ] Transformed 390 transitions.
[2024-05-22 05:18:56] [INFO ] Found NUPN structural information;
[2024-05-22 05:18:56] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 414 transition count 368
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 414 transition count 368
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 401 transition count 355
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 401 transition count 355
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 83 place count 401 transition count 345
Applied a total of 83 rules in 116 ms. Remains 401 /439 variables (removed 38) and now considering 345/390 (removed 45) transitions.
// Phase 1: matrix 345 rows 401 cols
[2024-05-22 05:18:56] [INFO ] Computed 62 invariants in 38 ms
[2024-05-22 05:18:57] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-22 05:18:57] [INFO ] Invariant cache hit.
[2024-05-22 05:18:57] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2024-05-22 05:18:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 345/746 variables, 401/463 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:06] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 26 ms to minimize.
[2024-05-22 05:19:06] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 3 ms to minimize.
[2024-05-22 05:19:06] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 4 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:19:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:19:08] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:19:09] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:13] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:19:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:19:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:19:14] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:19:15] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:19:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:19:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 13/496 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:19:21] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/746 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:23] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:19:23] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:19:24] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:19:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:19:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 507 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:30] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:19:30] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:19:30] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:19:31] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-05-22 05:19:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:19:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-22 05:19:38] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (OVERLAPS) 345/746 variables, 401/532 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 344/876 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 876 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 69/69 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 401/439 places, 345/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61292 ms. Remains : 401/439 places, 345/390 transitions.
Support contains 49 out of 401 places after structural reductions.
[2024-05-22 05:19:58] [INFO ] Flatten gal took : 54 ms
[2024-05-22 05:19:58] [INFO ] Flatten gal took : 25 ms
[2024-05-22 05:19:58] [INFO ] Input system was already deterministic with 345 transitions.
Support contains 48 out of 401 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (349 resets) in 1772 ms. (22 steps per ms) remains 14/34 properties
BEST_FIRST walk for 40004 steps (61 resets) in 314 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (63 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (51 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (60 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (50 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (61 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (58 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (50 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (53 resets) in 66 ms. (597 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (51 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (48 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (52 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (58 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
[2024-05-22 05:19:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 123/181 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 199/380 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 6/386 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 332/718 variables, 386/448 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 4/452 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 3 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 2/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 18/736 variables, 10/464 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:02] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-22 05:20:02] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 2/466 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 6/742 variables, 3/469 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/742 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 2/744 variables, 1/470 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 2/746 variables, 1/471 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 471 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 33/53 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 128/181 variables, 27/33 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 199/380 variables, 27/62 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 7/69 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 5/74 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 6/386 variables, 2/76 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 332/718 variables, 386/462 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 13/475 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/718 variables, 8/483 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 05:20:09] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:20:09] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:20:09] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/746 variables, and 486 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 386/401 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 25/25 constraints]
After SMT, in 10047ms problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 395 transition count 327
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 382 transition count 327
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 382 transition count 315
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 370 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 368 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 366 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 366 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 366 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 365 transition count 308
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 211 place count 292 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 292 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 289 transition count 249
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 289 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 288 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 287 transition count 247
Applied a total of 221 rules in 141 ms. Remains 287 /401 variables (removed 114) and now considering 247/345 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 287/401 places, 247/345 transitions.
RANDOM walk for 40000 steps (1455 resets) in 578 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (266 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (277 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (280 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (283 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (280 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (281 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (244 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (267 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (283 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (278 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (263 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (272 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (297 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 448993 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :2 out of 13
Probabilistic random walk after 448993 steps, saw 101797 distinct states, run finished after 3007 ms. (steps per millisecond=149 ) properties seen :2
// Phase 1: matrix 247 rows 287 cols
[2024-05-22 05:20:13] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 05:20:13] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 18/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 73/109 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 137/246 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 247/494 variables, 247/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 40/534 variables, 40/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/534 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 369 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 18/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 73/109 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 137/246 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 247/494 variables, 247/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 9/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:20:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 40/534 variables, 40/383 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 05:20:21] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 05:20:24] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/534 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 05:20:27] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/534 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/534 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/534 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 390 constraints, problems are : Problem set: 0 solved, 11 unsolved in 16667 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 10/10 constraints]
After SMT, in 18036ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 29359 ms.
Support contains 18 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 247/247 transitions.
Applied a total of 0 rules in 12 ms. Remains 287 /287 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 287/287 places, 247/247 transitions.
RANDOM walk for 40000 steps (1426 resets) in 378 ms. (105 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (273 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (268 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (284 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (277 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (267 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (268 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (272 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (267 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (263 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (260 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (275 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 517362 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :2 out of 11
Probabilistic random walk after 517362 steps, saw 117142 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :2
[2024-05-22 05:21:04] [INFO ] Invariant cache hit.
[2024-05-22 05:21:04] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 78/107 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 138/245 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/246 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 247/493 variables, 246/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 21/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 41/534 variables, 41/370 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/534 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 371 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 78/107 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 138/245 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:06] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/246 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 247/493 variables, 246/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 21/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 8/338 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:07] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:21:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:08] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 41/534 variables, 41/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:21:09] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:21:09] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 387 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4694 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 287/287 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints]
After SMT, in 6409ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 23569 ms.
Support contains 15 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 246
Applied a total of 1 rules in 20 ms. Remains 286 /287 variables (removed 1) and now considering 246/247 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 286/287 places, 246/247 transitions.
RANDOM walk for 40000 steps (1557 resets) in 257 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (292 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (259 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (259 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (313 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (281 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (278 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (286 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (275 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (309 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 591285 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 9
Probabilistic random walk after 591285 steps, saw 89050 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
// Phase 1: matrix 246 rows 286 cols
[2024-05-22 05:21:38] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 05:21:38] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 145/193 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 26/219 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 20/239 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 6/245 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 246/491 variables, 245/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 21/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 41/532 variables, 41/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 369 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 145/193 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 26/219 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 20/239 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/245 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 246/491 variables, 245/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 21/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 41/532 variables, 41/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/532 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:21:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/532 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 384 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 6638ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14656 ms.
Support contains 15 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 21 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 286/286 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 246/246 transitions.
Applied a total of 0 rules in 8 ms. Remains 286 /286 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-22 05:21:59] [INFO ] Invariant cache hit.
[2024-05-22 05:21:59] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 05:21:59] [INFO ] Invariant cache hit.
[2024-05-22 05:21:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:21:59] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 05:21:59] [INFO ] Redundant transitions in 14 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-22 05:21:59] [INFO ] Invariant cache hit.
[2024-05-22 05:21:59] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 2/284 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 2/286 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 246/532 variables, 286/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 21/368 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:14] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/532 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:18] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/532 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 373 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 2/284 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 2/286 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 246/532 variables, 286/352 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 21/373 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 242/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:22:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:22:43] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:22:43] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-22 05:22:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-22 05:22:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:22:55] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:22:56] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:22:56] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 8/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 623 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 286/286 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 13/13 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60702 ms. Remains : 286/286 places, 246/246 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 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 p1)||G(p2))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 398 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 398 transition count 342
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 395 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 395 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 395 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 394 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 394 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 394 transition count 334
Applied a total of 18 rules in 18 ms. Remains 394 /401 variables (removed 7) and now considering 334/345 (removed 11) transitions.
// Phase 1: matrix 334 rows 394 cols
[2024-05-22 05:23:00] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 05:23:00] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 05:23:00] [INFO ] Invariant cache hit.
[2024-05-22 05:23:01] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-22 05:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/728 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:23:08] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:23:12] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:23:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:23:19] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:23:19] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:23:19] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 5/464 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:20] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:23:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:23:22] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:23:22] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:23:22] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:23:23] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:23:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 19/483 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:23:29] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:23:29] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:23:30] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:23:30] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:23:30] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:23:30] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 490 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:33] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:23:34] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:23:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:36] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:23:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:23:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:23:37] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:23:39] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-22 05:23:39] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (OVERLAPS) 334/728 variables, 394/522 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 333/855 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 855 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 66/66 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 394/401 places, 334/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60796 ms. Remains : 394/401 places, 334/345 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-01
Product exploration explored 100000 steps with 900 reset in 283 ms.
Product exploration explored 100000 steps with 885 reset in 239 ms.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 217 stabilizing places and 209 stable transitions
Detected a total of 217/394 stabilizing places and 209/334 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 p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 184 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (353 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (65 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1422390 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :0 out of 1
Probabilistic random walk after 1422390 steps, saw 227938 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
[2024-05-22 05:24:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 250/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/353 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/379 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 321/700 variables, 379/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/718 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/724 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/728 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/728 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 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) 250/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/353 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:24:05] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/379 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 321/700 variables, 379/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:24:06] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:24:06] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:24:06] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/718 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/718 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/724 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/724 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/726 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/728 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/728 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1072ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 522 ms.
Support contains 2 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 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 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 388 transition count 314
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 373 transition count 314
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 373 transition count 301
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 360 transition count 301
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 209 place count 285 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 282 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 282 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 281 transition count 233
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 281 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 280 transition count 232
Applied a total of 219 rules in 59 ms. Remains 280 /394 variables (removed 114) and now considering 232/334 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 280/394 places, 232/334 transitions.
RANDOM walk for 40000 steps (1745 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (367 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1676850 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1676850 steps, saw 229584 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
// Phase 1: matrix 232 rows 280 cols
[2024-05-22 05:24:10] [INFO ] Computed 61 invariants in 8 ms
[2024-05-22 05:24:10] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/187 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/420 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 14/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/431 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/473 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/473 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/473 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/512 variables, 39/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/512 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/512 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/187 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/420 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 14/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/431 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/473 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/473 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/473 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/512 variables, 39/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/512 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/512 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 280/280 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 232/232 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-22 05:24:11] [INFO ] Invariant cache hit.
[2024-05-22 05:24:11] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 05:24:11] [INFO ] Invariant cache hit.
[2024-05-22 05:24:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 05:24:11] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-22 05:24:11] [INFO ] Redundant transitions in 3 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-22 05:24:11] [INFO ] Invariant cache hit.
[2024-05-22 05:24:11] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 1/279 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 232/511 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 1/512 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 05:24:25] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:24:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:24:25] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:24:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 05:24:28] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (OVERLAPS) 0/512 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 360 constraints, problems are : Problem set: 0 solved, 229 unsolved in 25032 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 1/279 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 05:24:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 232/511 variables, 279/346 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 14/360 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 229/589 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-22 05:24:48] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:24:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/512 variables, and 591 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 8/8 constraints]
After SMT, in 55168ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 55170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55630 ms. Remains : 280/280 places, 232/232 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 960 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 2 place count 279 transition count 232
Applied a total of 2 rules in 13 ms. Remains 279 /280 variables (removed 1) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 279 cols
[2024-05-22 05:25:06] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 05:25:06] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:25:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 05:25:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-22 05:25:07] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:25:07] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:25:07] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-22 05:25:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
TRAPS : Iteration 1
[2024-05-22 05:25:07] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:25:07] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 609 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
Support contains 2 out of 394 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 334/334 transitions.
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 387 transition count 317
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 374 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 374 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 362 transition count 305
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 2 with 146 rules applied. Total rules applied 197 place count 289 transition count 232
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 287 transition count 234
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 285 transition count 232
Applied a total of 203 rules in 74 ms. Remains 285 /394 variables (removed 109) and now considering 232/334 (removed 102) transitions.
// Phase 1: matrix 232 rows 285 cols
[2024-05-22 05:25:07] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 05:25:08] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 05:25:08] [INFO ] Invariant cache hit.
[2024-05-22 05:25:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 05:25:08] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-22 05:25:08] [INFO ] Redundant transitions in 5 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-22 05:25:08] [INFO ] Invariant cache hit.
[2024-05-22 05:25:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 232/516 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 1/517 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (OVERLAPS) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 352 constraints, problems are : Problem set: 0 solved, 228 unsolved in 15739 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 232/516 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 228/579 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:25:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/517 variables, and 586 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 7/7 constraints]
After SMT, in 45870ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 45872ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/394 places, 232/334 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46534 ms. Remains : 285/394 places, 232/334 transitions.
Computed a total of 179 stabilizing places and 173 stable transitions
Computed a total of 179 stabilizing places and 173 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (1698 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (337 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1609945 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :0 out of 1
Probabilistic random walk after 1609945 steps, saw 218795 distinct states, run finished after 3001 ms. (steps per millisecond=536 ) properties seen :0
[2024-05-22 05:25:57] [INFO ] Invariant cache hit.
[2024-05-22 05:25:57] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/154 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/189 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/225 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/236 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/426 variables, 236/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/435 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/477 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/477 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 40/517 variables, 40/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/517 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 352 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/154 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/189 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 36/225 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/236 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 190/426 variables, 236/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/435 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/477 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/517 variables, 40/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/517 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/517 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 245 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 232/232 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 285 transition count 231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 282 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 282 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 281 transition count 227
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 10 place count 281 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 278 transition count 225
Applied a total of 13 rules in 28 ms. Remains 278 /285 variables (removed 7) and now considering 225/232 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 278/285 places, 225/232 transitions.
RANDOM walk for 40000 steps (1897 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (358 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1594114 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :0 out of 1
Probabilistic random walk after 1594114 steps, saw 217905 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
// Phase 1: matrix 225 rows 278 cols
[2024-05-22 05:26:01] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 05:26:01] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 183/413 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/422 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/464 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/464 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/464 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/503 variables, 39/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/503 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/503 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 183/413 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/422 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/464 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/464 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/464 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/503 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/503 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/503 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-22 05:26:02] [INFO ] Invariant cache hit.
[2024-05-22 05:26:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 05:26:02] [INFO ] Invariant cache hit.
[2024-05-22 05:26:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 05:26:02] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-22 05:26:02] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 05:26:02] [INFO ] Invariant cache hit.
[2024-05-22 05:26:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/502 variables, 277/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:10] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:14] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:19] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:26:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:24] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:26:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:26:24] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/503 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (OVERLAPS) 0/503 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 350 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28688 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 225/502 variables, 277/343 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 222/571 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/503 variables, and 572 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 8/8 constraints]
After SMT, in 58821ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 58823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59246 ms. Remains : 278/278 places, 225/225 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 278 transition count 225
Applied a total of 1 rules in 10 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2024-05-22 05:27:01] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:27:01] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:27:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:27:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 05:27:01] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:27:01] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:27:01] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 4314 reset in 203 ms.
Product exploration explored 100000 steps with 4247 reset in 241 ms.
Built C files in :
/tmp/ltsmin9248025254252020893
[2024-05-22 05:27:02] [INFO ] Computing symmetric may disable matrix : 232 transitions.
[2024-05-22 05:27:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:02] [INFO ] Computing symmetric may enable matrix : 232 transitions.
[2024-05-22 05:27:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:02] [INFO ] Computing Do-Not-Accords matrix : 232 transitions.
[2024-05-22 05:27:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:02] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9248025254252020893
Running compilation step : cd /tmp/ltsmin9248025254252020893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin9248025254252020893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9248025254252020893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15310096149055598803.hoa' '--buchi-type=spotba'
LTSmin run took 3093 ms.
FORMULA DES-PT-40b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLFireability-01 finished in 245540 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||(X((p0&&G(p2)))&&p1))))'
Support contains 1 out of 401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
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 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 221 place count 286 transition count 229
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 225 place count 284 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 283 transition count 230
Applied a total of 226 rules in 46 ms. Remains 283 /401 variables (removed 118) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 283 cols
[2024-05-22 05:27:06] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 05:27:06] [INFO ] Implicit Places using invariants in 157 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Computed a total of 178 stabilizing places and 173 stable transitions
Computed a total of 178 stabilizing places and 173 stable transitions
Detected a total of 178/282 stabilizing places and 173/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-03 finished in 782 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)))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
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 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
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 393 transition count 333
Applied a total of 20 rules in 24 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:27:06] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 05:27:07] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 05:27:07] [INFO ] Invariant cache hit.
[2024-05-22 05:27:07] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:27:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:12] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:27:12] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-22 05:27:13] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:27:14] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:27:14] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:27:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:27:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:27:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:27:15] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:27:16] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:20] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:27:21] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:27:22] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 4 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-22 05:27:25] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:27:27] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:34] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:27:34] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:27:34] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:27:34] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 2 ms to minimize.
[2024-05-22 05:27:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:27:41] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:27:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:27:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:27:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:27:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:27:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:27:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:46] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 60913 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 ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
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 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
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 393 transition count 333
Applied a total of 20 rules in 27 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-22 05:28:07] [INFO ] Invariant cache hit.
[2024-05-22 05:28:08] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 05:28:08] [INFO ] Invariant cache hit.
[2024-05-22 05:28:08] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:28:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:28:15] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:28:15] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:28:15] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:28:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:28:16] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:28:16] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:28:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:28:17] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:28:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:28:22] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:28:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:28:26] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:28:27] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:28:31] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:28:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:28:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30825 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05
Product exploration explored 100000 steps with 873 reset in 240 ms.
Product exploration explored 100000 steps with 891 reset in 211 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 138 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (360 resets) in 146 ms. (272 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2024-05-22 05:28:39] [INFO ] Invariant cache hit.
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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:28:40] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:28:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
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 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 49 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 278/393 places, 224/333 transitions.
RANDOM walk for 40000 steps (1745 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (340 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1713801 steps, run timeout after 3001 ms. (steps per millisecond=571 ) properties seen :0 out of 1
Probabilistic random walk after 1713801 steps, saw 234499 distinct states, run finished after 3001 ms. (steps per millisecond=571 ) properties seen :0
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 05:28:43] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 05:28:43] [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) 135/145 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/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/421 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/463 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/502 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/421 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/421 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/463 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/502 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 11 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 05:28:44] [INFO ] Invariant cache hit.
[2024-05-22 05:28:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 05:28:44] [INFO ] Invariant cache hit.
[2024-05-22 05:28:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 05:28:44] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-22 05:28:45] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-22 05:28:45] [INFO ] Invariant cache hit.
[2024-05-22 05:28:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 224/501 variables, 277/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:28:52] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:28:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/502 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 346 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20485 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 224/501 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 221/566 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:29:18] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:29:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:29:19] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:29:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:29:23] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:29:23] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:29:28] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 573 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 50603ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 50607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51087 ms. Remains : 278/278 places, 224/224 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 278 transition count 224
Applied a total of 1 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 05:29:35] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 05:29:35] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:29:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 05:29:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:29:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:29:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:29:35] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:29:35] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:29:35] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 309 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 262 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 180 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 11 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:29:36] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 05:29:36] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 05:29:36] [INFO ] Invariant cache hit.
[2024-05-22 05:29:37] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:29:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:50] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:04] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:30:04] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:09] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:30:09] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-22 05:30:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:16] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:30:18] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:19] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:30:19] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Finished structural reductions in LTL mode , in 1 iterations and 60756 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (344 resets) in 93 ms. (425 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (64 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-05-22 05:30:37] [INFO ] Invariant cache hit.
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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 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) 244/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/350 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/378 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:30:38] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:30:38] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 219 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
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 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
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 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 34 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 278/393 places, 224/333 transitions.
RANDOM walk for 40000 steps (1778 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (351 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1702751 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :0 out of 1
Probabilistic random walk after 1702751 steps, saw 233063 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 05:30:41] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 05:30:41] [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) 135/145 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/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/421 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/463 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/502 variables, 39/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/502 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 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) 135/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/188 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/221 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 182/412 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/421 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/421 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/463 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/502 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/502 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 05:30:42] [INFO ] Invariant cache hit.
[2024-05-22 05:30:42] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 05:30:42] [INFO ] Invariant cache hit.
[2024-05-22 05:30:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 05:30:42] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-22 05:30:42] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-22 05:30:42] [INFO ] Invariant cache hit.
[2024-05-22 05:30:42] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/276 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/277 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 224/501 variables, 277/337 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:30:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:30:54] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/502 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 346 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20631 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/276 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 224/501 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 221/566 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:31:15] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:31:15] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:31:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:31:20] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:31:20] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:31:20] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:31:25] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/502 variables, and 573 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/278 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 50767ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 50770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51220 ms. Remains : 278/278 places, 224/224 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 278 transition count 224
Applied a total of 1 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2024-05-22 05:31:33] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 05:31:33] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:31:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 05:31:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:31:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:31:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 05:31:33] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:31:33] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:31:33] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 161 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 881 reset in 172 ms.
Product exploration explored 100000 steps with 875 reset in 183 ms.
Built C files in :
/tmp/ltsmin11402666973210395357
[2024-05-22 05:31:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11402666973210395357
Running compilation step : cd /tmp/ltsmin11402666973210395357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 619 ms.
Running link step : cd /tmp/ltsmin11402666973210395357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11402666973210395357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15920107551687457617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:31:50] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 05:31:50] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 05:31:50] [INFO ] Invariant cache hit.
[2024-05-22 05:31:50] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:31:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:31:57] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:31:58] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:31:58] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:31:58] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:31:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:32:00] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:32:06] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:32:06] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:32:06] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-22 05:32:10] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:32:11] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:32:11] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:32:12] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:32:20] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
0.0)
(s2 0.0)
(s3 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:32:23] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:32:23] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:32:24] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:32:26] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:32:26] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:32:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:32:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:30] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:32:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:32:32] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:32:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin2165638491649192386
[2024-05-22 05:32:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2165638491649192386
Running compilation step : cd /tmp/ltsmin2165638491649192386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin2165638491649192386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2165638491649192386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2797412625666602002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 05:33:06] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:33:06] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:33:06] [INFO ] Time to serialize gal into /tmp/LTL17096320165274561352.gal : 5 ms
[2024-05-22 05:33:06] [INFO ] Time to serialize properties into /tmp/LTL16614838632531016.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17096320165274561352.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13715896286574581057.hoa' '-atoms' '/tmp/LTL16614838632531016.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16614838632531016.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13715896286574581057.hoa
Detected timeout of ITS tools.
[2024-05-22 05:33:21] [INFO ] Flatten gal took : 18 ms
[2024-05-22 05:33:21] [INFO ] Flatten gal took : 17 ms
[2024-05-22 05:33:21] [INFO ] Time to serialize gal into /tmp/LTL12805127967503153318.gal : 3 ms
[2024-05-22 05:33:21] [INFO ] Time to serialize properties into /tmp/LTL16837722728343516499.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12805127967503153318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16837722728343516499.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((X(!("((p85==1)&&(p431==1))")))U((X(G(!("((p85==1)&&(p431==1))"))))||((X(!("((p85==1)&&(p431==1))")))&&(G((!("((p85==1)&&(p431==1)...589
Formula 0 simplified : "((p158==1)&&(p189==1))" U (X"((p85==1)&&(p431==1))" R (XF"((p85==1)&&(p431==1))" & (X"((p85==1)&&(p431==1))" | F("((p85==1)&&(p431=...192
Detected timeout of ITS tools.
[2024-05-22 05:33:36] [INFO ] Flatten gal took : 23 ms
[2024-05-22 05:33:36] [INFO ] Applying decomposition
[2024-05-22 05:33:36] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13021320920216751598.txt' '-o' '/tmp/graph13021320920216751598.bin' '-w' '/tmp/graph13021320920216751598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13021320920216751598.bin' '-l' '-1' '-v' '-w' '/tmp/graph13021320920216751598.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:33:36] [INFO ] Decomposing Gal with order
[2024-05-22 05:33:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:33:36] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:33:36] [INFO ] Flatten gal took : 51 ms
[2024-05-22 05:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 05:33:36] [INFO ] Time to serialize gal into /tmp/LTL7376565257786923549.gal : 5 ms
[2024-05-22 05:33:36] [INFO ] Time to serialize properties into /tmp/LTL1964661913091195964.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7376565257786923549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1964661913091195964.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X(!("((i9.u74.p85==1)&&(i9.u74.p431==1))")))U((X(G(!("((i9.u74.p85==1)&&(i9.u74.p431==1))"))))||((X(!("((i9.u74.p85==1)&&(i9.u74....805
Formula 0 simplified : "((i2.u9.p158==1)&&(i2.u9.p189==1))" U (X"((i9.u74.p85==1)&&(i9.u74.p431==1))" R (XF"((i9.u74.p85==1)&&(i9.u74.p431==1))" & (X"((i9....272
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 343929 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(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
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 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
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 225 place count 284 transition count 227
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 229 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 279 transition count 227
Applied a total of 232 rules in 45 ms. Remains 279 /401 variables (removed 122) and now considering 227/345 (removed 118) transitions.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 05:33:51] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:33:51] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 05:33:51] [INFO ] Invariant cache hit.
[2024-05-22 05:33:52] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-22 05:33:52] [INFO ] Redundant transitions in 2 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-22 05:33:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:33:56] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:33:57] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:33:57] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:34:00] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:34:00] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:34:01] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 17870 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 48015ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/401 places, 227/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48517 ms. Remains : 279/401 places, 227/345 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06
Product exploration explored 100000 steps with 33414 reset in 194 ms.
Product exploration explored 100000 steps with 33344 reset in 246 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2107 resets) in 112 ms. (353 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (430 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
[2024-05-22 05:34:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/122 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/151 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/210 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/219 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/225 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 181/406 variables, 225/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/420 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 45/465 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/465 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/466 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/466 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/466 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/506 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/506 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 122/506 variables, and 17 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/33 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/279 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p2 p1))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 05:34:42] [INFO ] Invariant cache hit.
[2024-05-22 05:34:42] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 05:34:42] [INFO ] Invariant cache hit.
[2024-05-22 05:34:42] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-22 05:34:42] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-22 05:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:34:46] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:34:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:34:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:34:50] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:34:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:34:51] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 17960 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 48094ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48642 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 1437 steps (71 resets) in 13 ms. (102 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p1), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 6148 reset in 189 ms.
Product exploration explored 100000 steps with 6214 reset in 209 ms.
Built C files in :
/tmp/ltsmin7163380765708355417
[2024-05-22 05:35:31] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-22 05:35:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:31] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-22 05:35:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:31] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-22 05:35:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7163380765708355417
Running compilation step : cd /tmp/ltsmin7163380765708355417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin7163380765708355417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7163380765708355417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased151606125636531922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 12 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 05:35:47] [INFO ] Invariant cache hit.
[2024-05-22 05:35:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 05:35:47] [INFO ] Invariant cache hit.
[2024-05-22 05:35:47] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-22 05:35:47] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-22 05:35:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/278 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 227/505 variables, 278/336 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:35:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:35:53] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 05:35:55] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:35:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:35:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/506 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 343 constraints, problems are : Problem set: 0 solved, 224 unsolved in 17701 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/505 variables, 278/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 224/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 47844ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 47848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48297 ms. Remains : 279/279 places, 227/227 transitions.
Built C files in :
/tmp/ltsmin1280681275350504939
[2024-05-22 05:36:35] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-22 05:36:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:36:35] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-22 05:36:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:36:35] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-22 05:36:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:36:35] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1280681275350504939
Running compilation step : cd /tmp/ltsmin1280681275350504939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 580 ms.
Running link step : cd /tmp/ltsmin1280681275350504939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1280681275350504939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9045744928869885435.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 05:36:50] [INFO ] Flatten gal took : 27 ms
[2024-05-22 05:36:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:36:50] [INFO ] Time to serialize gal into /tmp/LTL3213640852865319162.gal : 2 ms
[2024-05-22 05:36:50] [INFO ] Time to serialize properties into /tmp/LTL2192124864754993665.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3213640852865319162.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2133626667984943840.hoa' '-atoms' '/tmp/LTL2192124864754993665.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2192124864754993665.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2133626667984943840.hoa
Detected timeout of ITS tools.
[2024-05-22 05:37:05] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:37:05] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:37:05] [INFO ] Time to serialize gal into /tmp/LTL756472345224498781.gal : 2 ms
[2024-05-22 05:37:05] [INFO ] Time to serialize properties into /tmp/LTL6679433619115107714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL756472345224498781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6679433619115107714.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((((p318==0)||(p320==0))||((p322==0)||(p324==0)))||(((p326==0)||(p328==0))||((p330==0)||(p332==0))))")||(F("((((p318==1)&&...382
Formula 0 simplified : F((G!"((((p318==1)&&(p320==1))&&((p322==1)&&(p324==1)))&&(((p326==1)&&(p328==1))&&((p330==1)&&(p332==1))))" & XG!"(p284==0)") | G(F!...367
Detected timeout of ITS tools.
[2024-05-22 05:37:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:37:20] [INFO ] Applying decomposition
[2024-05-22 05:37:20] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5196749333311023129.txt' '-o' '/tmp/graph5196749333311023129.bin' '-w' '/tmp/graph5196749333311023129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5196749333311023129.bin' '-l' '-1' '-v' '-w' '/tmp/graph5196749333311023129.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:37:20] [INFO ] Decomposing Gal with order
[2024-05-22 05:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:37:20] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 05:37:20] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2024-05-22 05:37:20] [INFO ] Time to serialize gal into /tmp/LTL4114449365683076628.gal : 4 ms
[2024-05-22 05:37:20] [INFO ] Time to serialize properties into /tmp/LTL14524284200151658428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4114449365683076628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14524284200151658428.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("((((i7.i2.u13.p318==0)||(i8.u14.p320==0))||((i9.u15.p322==0)||(i5.u16.p324==0)))||(((i6.u17.p326==0)||(i7.i0.u18.p328==0))...589
Formula 0 simplified : F((G!"((((i7.i2.u13.p318==1)&&(i8.u14.p320==1))&&((i9.u15.p322==1)&&(i5.u16.p324==1)))&&(((i6.u17.p326==1)&&(i7.i0.u18.p328==1))&&((...574
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 224060 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)) U (p1||(p1 U p2))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 382 transition count 318
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 47 place count 371 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 367 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 363 transition count 305
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 361 transition count 304
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 219 place count 287 transition count 230
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 285 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 283 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 282 transition count 230
Applied a total of 226 rules in 48 ms. Remains 282 /401 variables (removed 119) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 282 cols
[2024-05-22 05:37:35] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 05:37:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 05:37:36] [INFO ] Invariant cache hit.
[2024-05-22 05:37:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 05:37:36] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-22 05:37:36] [INFO ] Redundant transitions in 1 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-22 05:37:36] [INFO ] Invariant cache hit.
[2024-05-22 05:37:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 2/281 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 230/512 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:37:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:37:44] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:37:44] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:37:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:37:48] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/512 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 13 (OVERLAPS) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 351 constraints, problems are : Problem set: 0 solved, 227 unsolved in 20322 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 2/281 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 1/282 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 230/512 variables, 282/345 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 227/578 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:38:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:38:15] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 581 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 8/8 constraints]
After SMT, in 50457ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 50460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50970 ms. Remains : 282/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 51117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 394 transition count 331
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 384 transition count 331
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 21 place count 384 transition count 319
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 45 place count 372 transition count 319
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 370 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 368 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 367 transition count 312
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 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 40 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 05:38:26] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 05:38:27] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 05:38:27] [INFO ] Invariant cache hit.
[2024-05-22 05:38:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:38:27] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-22 05:38:27] [INFO ] Redundant transitions in 2 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-22 05:38:27] [INFO ] Invariant cache hit.
[2024-05-22 05:38:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:38:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:38:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 19916 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:39:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:39:13] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:39:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:39:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:39:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 50075ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 50080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50771 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND p0 (NOT p1)), true, (AND (NOT p2) (NOT p1) p0), (AND (NOT p3) (NOT p1) p0), (AND (NOT p1) p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DES-PT-40b-LTLFireability-08
Product exploration explored 100000 steps with 5145 reset in 256 ms.
Product exploration explored 100000 steps with 5154 reset in 288 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 183 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
RANDOM walk for 40000 steps (1966 resets) in 289 ms. (137 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (362 resets) in 558 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (357 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (362 resets) in 410 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (350 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (350 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (344 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
[2024-05-22 05:39:19] [INFO ] Invariant cache hit.
[2024-05-22 05:39:19] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/450 variables, 9/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/492 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/492 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 40/532 variables, 40/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 365 constraints, problems are : Problem set: 2 solved, 4 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 4/315 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/315 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 11/450 variables, 9/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 2/326 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 05:39:20] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 1/327 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/492 variables, 2/329 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 1/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/492 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 40/532 variables, 40/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/532 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 370 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1673ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9072 ms.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 285 transition count 246
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 284 transition count 245
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 284 transition count 245
Applied a total of 4 rules in 21 ms. Remains 284 /285 variables (removed 1) and now considering 245/247 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 284/285 places, 245/247 transitions.
RANDOM walk for 40000 steps (1879 resets) in 1283 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (357 resets) in 321 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (324 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (373 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 686012 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 4
Probabilistic random walk after 686012 steps, saw 92570 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
// Phase 1: matrix 245 rows 284 cols
[2024-05-22 05:39:34] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 05:39:34] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/448 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/490 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 39/529 variables, 39/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 05:39:35] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/448 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 05:39:35] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:39:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/448 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/448 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 42/490 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/490 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 39/529 variables, 39/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/529 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/529 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 372 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1318 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8417 ms.
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 284/284 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 05:39:44] [INFO ] Invariant cache hit.
[2024-05-22 05:39:44] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 05:39:44] [INFO ] Invariant cache hit.
[2024-05-22 05:39:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:39:44] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-22 05:39:45] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-22 05:39:45] [INFO ] Invariant cache hit.
[2024-05-22 05:39:45] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 245/528 variables, 283/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/529 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:39:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:39:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:39:57] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:39:57] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:39:57] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:40:03] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/529 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 371 constraints, problems are : Problem set: 0 solved, 242 unsolved in 26204 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/528 variables, 283/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 21/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 242/611 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:40:33] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 283/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 9/10 constraints]
After SMT, in 56351ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 56355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56871 ms. Remains : 284/284 places, 245/245 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 926 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
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 2 place count 283 transition count 245
Applied a total of 2 rules in 11 ms. Remains 283 /284 variables (removed 1) and now considering 245/245 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 245 rows 283 cols
[2024-05-22 05:40:41] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 05:40:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:40:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 05:40:41] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 05:40:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:40:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 05:40:41] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 05:40:41] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-05-22 05:40:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:40:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:40:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
TRAPS : Iteration 2
[2024-05-22 05:40:42] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 05:40:42] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1075 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 24 factoid took 306 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 05:40:43] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 05:40:43] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 05:40:43] [INFO ] Invariant cache hit.
[2024-05-22 05:40:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:40:43] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-22 05:40:43] [INFO ] Redundant transitions in 3 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-22 05:40:43] [INFO ] Invariant cache hit.
[2024-05-22 05:40:43] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:40:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:40:53] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 19812 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:41:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:41:29] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:41:31] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:41:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:41:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 49951ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 49955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50562 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 147 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1920 resets) in 1165 ms. (34 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (371 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (384 resets) in 385 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (364 resets) in 462 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (372 resets) in 394 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (372 resets) in 367 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (361 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
[2024-05-22 05:41:35] [INFO ] Invariant cache hit.
[2024-05-22 05:41:35] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/234 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 205/439 variables, 234/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/450 variables, 9/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/492 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/492 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 40/532 variables, 40/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/365 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 365 constraints, problems are : Problem set: 2 solved, 4 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/227 variables, 18/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 05:41:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:41:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 2/55 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/234 variables, 3/58 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 205/439 variables, 234/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/313 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 4/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/450 variables, 9/326 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 2/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/492 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/492 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 40/532 variables, 40/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/532 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 371 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 1589ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8585 ms.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 285 transition count 246
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 284 transition count 245
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 284 transition count 245
Applied a total of 4 rules in 20 ms. Remains 284 /285 variables (removed 1) and now considering 245/247 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 284/285 places, 245/247 transitions.
RANDOM walk for 40000 steps (1860 resets) in 1097 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (345 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (362 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (334 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 695312 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 4
Probabilistic random walk after 695312 steps, saw 93772 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
// Phase 1: matrix 245 rows 284 cols
[2024-05-22 05:41:49] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 05:41:49] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/448 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 42/490 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 39/529 variables, 39/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/529 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 27/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 169/206 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/231 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/234 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 203/437 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 21/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 05:41:50] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/448 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/448 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 42/490 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 39/529 variables, 39/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1711ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8062 ms.
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 284/284 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 284 /284 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 05:41:58] [INFO ] Invariant cache hit.
[2024-05-22 05:41:59] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 05:41:59] [INFO ] Invariant cache hit.
[2024-05-22 05:41:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:41:59] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-22 05:41:59] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-22 05:41:59] [INFO ] Invariant cache hit.
[2024-05-22 05:41:59] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 245/528 variables, 283/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/529 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:42:10] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:42:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:42:11] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:42:11] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:42:11] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:42:17] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/529 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 15 (OVERLAPS) 0/529 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 371 constraints, problems are : Problem set: 0 solved, 242 unsolved in 26103 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/528 variables, 283/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 21/369 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 242/611 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:42:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:42:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:42:42] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:42:47] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 283/284 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 9/10 constraints]
After SMT, in 56262ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 56266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56738 ms. Remains : 284/284 places, 245/245 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 926 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 2 place count 283 transition count 245
Applied a total of 2 rules in 8 ms. Remains 283 /284 variables (removed 1) and now considering 245/245 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 245 rows 283 cols
[2024-05-22 05:42:55] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 05:42:55] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 05:42:55] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 05:42:55] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 05:42:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:42:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 05:42:56] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 05:42:56] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-05-22 05:42:56] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 05:42:56] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 839 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p2)]
Knowledge based reduction with 22 factoid took 269 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), false, (AND (NOT p2) p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 5175 reset in 267 ms.
Product exploration explored 100000 steps with 5179 reset in 285 ms.
Built C files in :
/tmp/ltsmin5900728957236006881
[2024-05-22 05:42:58] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 05:42:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:42:58] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 05:42:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:42:58] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 05:42:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:42:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5900728957236006881
Running compilation step : cd /tmp/ltsmin5900728957236006881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin5900728957236006881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5900728957236006881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16217786731398761868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 12 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 05:43:13] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 05:43:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 05:43:13] [INFO ] Invariant cache hit.
[2024-05-22 05:43:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 05:43:14] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-22 05:43:14] [INFO ] Redundant transitions in 2 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-22 05:43:14] [INFO ] Invariant cache hit.
[2024-05-22 05:43:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 247/531 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 21/364 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:43:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:43:23] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 367 constraints, problems are : Problem set: 0 solved, 244 unsolved in 19676 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 247/531 variables, 284/345 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 244/610 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-22 05:43:56] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:43:56] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:43:56] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:43:57] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:43:57] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:43:59] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:43:59] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:44:01] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:44:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:44:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 12/12 constraints]
After SMT, in 49846ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 49850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50478 ms. Remains : 285/285 places, 247/247 transitions.
Built C files in :
/tmp/ltsmin14310289073371976918
[2024-05-22 05:44:03] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 05:44:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:44:03] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 05:44:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:44:03] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 05:44:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:44:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14310289073371976918
Running compilation step : cd /tmp/ltsmin14310289073371976918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin14310289073371976918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14310289073371976918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1086613050016612703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 05:44:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:44:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:44:19] [INFO ] Time to serialize gal into /tmp/LTL16049400359307791694.gal : 3 ms
[2024-05-22 05:44:19] [INFO ] Time to serialize properties into /tmp/LTL8593733900879379770.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16049400359307791694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2696378005687910323.hoa' '-atoms' '/tmp/LTL8593733900879379770.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8593733900879379770.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2696378005687910323.hoa
Detected timeout of ITS tools.
[2024-05-22 05:44:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:44:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:44:34] [INFO ] Time to serialize gal into /tmp/LTL13725851031718838055.gal : 2 ms
[2024-05-22 05:44:34] [INFO ] Time to serialize properties into /tmp/LTL1106927349222631296.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13725851031718838055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1106927349222631296.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((!("((p9==1)&&(p290==1))"))U((G(!("((p9==1)&&(p290==1))")))||("((!(((p162==1)&&(p189==1))&&(p197==1)))&&(!((p9==1)&&(p290==1))))")...473
Formula 0 simplified : ("((p9==1)&&(p290==1))" M !"((!(((p162==1)&&(p189==1))&&(p197==1)))&&(!((p9==1)&&(p290==1))))") R (F(!"((!(((p162==1)&&(p189==1))&&(...351
Detected timeout of ITS tools.
[2024-05-22 05:44:49] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:44:49] [INFO ] Applying decomposition
[2024-05-22 05:44:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1322965811685334192.txt' '-o' '/tmp/graph1322965811685334192.bin' '-w' '/tmp/graph1322965811685334192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1322965811685334192.bin' '-l' '-1' '-v' '-w' '/tmp/graph1322965811685334192.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:44:49] [INFO ] Decomposing Gal with order
[2024-05-22 05:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:44:49] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-22 05:44:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 3 ms.
[2024-05-22 05:44:49] [INFO ] Time to serialize gal into /tmp/LTL12185986712270519998.gal : 3 ms
[2024-05-22 05:44:49] [INFO ] Time to serialize properties into /tmp/LTL18076915997814552371.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12185986712270519998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18076915997814552371.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((!("((u10.p9==1)&&(u10.p290==1))"))U((G(!("((u10.p9==1)&&(u10.p290==1))")))||("((!(((u1.p162==1)&&(u1.p189==1))&&(u1.p197==1)))&&(...585
Formula 0 simplified : ("((u10.p9==1)&&(u10.p290==1))" M !"((!(((u1.p162==1)&&(u1.p189==1))&&(u1.p197==1)))&&(!((u10.p9==1)&&(u10.p290==1))))") R (F(!"((!(...439
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-08 finished in 397474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
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 49 place count 370 transition count 317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 368 transition count 315
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 366 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 366 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 365 transition count 310
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 211 place count 290 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 218 place count 287 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 285 transition count 247
Applied a total of 220 rules in 41 ms. Remains 285 /401 variables (removed 116) and now considering 247/345 (removed 98) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 05:45:04] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:45:04] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 05:45:04] [INFO ] Invariant cache hit.
[2024-05-22 05:45:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 05:45:04] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-22 05:45:04] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-22 05:45:04] [INFO ] Invariant cache hit.
[2024-05-22 05:45:04] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 247/532 variables, 285/344 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-22 05:45:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:45:14] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:45:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 243 unsolved in 17390 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 2/283 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 2/285 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 247/532 variables, 285/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 243/602 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-22 05:45:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:45:46] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 604 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 5/5 constraints]
After SMT, in 47530ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 47534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/401 places, 247/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48108 ms. Remains : 285/401 places, 247/345 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09
Product exploration explored 100000 steps with 4698 reset in 312 ms.
Product exploration explored 100000 steps with 4704 reset in 254 ms.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p2]
RANDOM walk for 40000 steps (1921 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (324 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1637914 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :0 out of 1
Probabilistic random walk after 1637914 steps, saw 208163 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
[2024-05-22 05:45:56] [INFO ] Invariant cache hit.
[2024-05-22 05:45:56] [INFO ] State equation strengthened by 12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 435 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
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 284 transition count 245
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 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
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 2 with 2 rules applied. Total rules applied 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 33 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 280/285 places, 233/247 transitions.
RANDOM walk for 40000 steps (1960 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (380 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1675760 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1675760 steps, saw 224349 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 05:46:00] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 05:46:00] [INFO ] State equation strengthened by 8 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/231 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 230/461 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/513 variables, 49/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:46:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/231 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/461 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/513 variables, 49/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 299 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 05:46:01] [INFO ] Invariant cache hit.
[2024-05-22 05:46:01] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 05:46:01] [INFO ] Invariant cache hit.
[2024-05-22 05:46:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 05:46:01] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-22 05:46:01] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-22 05:46:01] [INFO ] Invariant cache hit.
[2024-05-22 05:46:01] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 233/513 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:46:13] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:46:14] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/513 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 230 unsolved in 20932 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 233/513 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 230/580 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:46:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:46:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:46:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:46:39] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 584 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
After SMT, in 51086ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 51090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51605 ms. Remains : 280/280 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 05:46:53] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 05:46:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:46:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:46:53] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:46:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:46:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 05:46:53] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:46:53] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:46:53] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 286 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 148 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 32 ms :[p2]
Stuttering acceptance computed with spot in 35 ms :[p2]
Support contains 2 out of 285 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 285 /285 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 285 cols
[2024-05-22 05:46:53] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 05:46:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 05:46:53] [INFO ] Invariant cache hit.
[2024-05-22 05:46:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 05:46:54] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 05:46:54] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-22 05:46:54] [INFO ] Invariant cache hit.
[2024-05-22 05:46:54] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 247/532 variables, 285/344 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-22 05:47:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:47:03] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:47:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 243 unsolved in 16986 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 2/283 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 2/285 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 247/532 variables, 285/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 243/602 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:47:35] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 604 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 5/5 constraints]
After SMT, in 47151ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 47153ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47652 ms. Remains : 285/285 places, 247/247 transitions.
Computed a total of 178 stabilizing places and 183 stable transitions
Computed a total of 178 stabilizing places and 183 stable transitions
Detected a total of 178/285 stabilizing places and 183/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 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 41 ms :[p2]
RANDOM walk for 40000 steps (1882 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (301 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1661932 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :0 out of 1
Probabilistic random walk after 1661932 steps, saw 211441 distinct states, run finished after 3001 ms. (steps per millisecond=553 ) properties seen :0
[2024-05-22 05:47:44] [INFO ] Invariant cache hit.
[2024-05-22 05:47:44] [INFO ] State equation strengthened by 12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/532 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/187 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/226 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/235 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/479 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 53/532 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/532 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 429 ms.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 247/247 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 285 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 285 transition count 245
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 284 transition count 245
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 5 place count 283 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 282 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 282 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 282 transition count 235
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 2 with 2 rules applied. Total rules applied 17 place count 281 transition count 234
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 281 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 280 transition count 233
Applied a total of 19 rules in 16 ms. Remains 280 /285 variables (removed 5) and now considering 233/247 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 280/285 places, 233/247 transitions.
RANDOM walk for 40000 steps (1982 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1701554 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :0 out of 1
Probabilistic random walk after 1701554 steps, saw 227279 distinct states, run finished after 3001 ms. (steps per millisecond=566 ) properties seen :0
// Phase 1: matrix 233 rows 280 cols
[2024-05-22 05:47:48] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 05:47:48] [INFO ] State equation strengthened by 8 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/231 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 230/461 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/513 variables, 49/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:47:48] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/152 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/190 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/222 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/231 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/461 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/513 variables, 49/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 280/280 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 233/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-22 05:47:49] [INFO ] Invariant cache hit.
[2024-05-22 05:47:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 05:47:49] [INFO ] Invariant cache hit.
[2024-05-22 05:47:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 05:47:49] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-22 05:47:49] [INFO ] Redundant transitions in 2 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-22 05:47:49] [INFO ] Invariant cache hit.
[2024-05-22 05:47:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 233/513 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:48:02] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:48:02] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/513 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (OVERLAPS) 0/513 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 350 constraints, problems are : Problem set: 0 solved, 230 unsolved in 21456 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 233/513 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 8/350 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 230/580 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:48:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:48:25] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:48:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:48:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 584 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
After SMT, in 51583ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 51586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52096 ms. Remains : 280/280 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 964 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 279 /280 variables (removed 1) and now considering 233/233 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2024-05-22 05:48:41] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 05:48:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:48:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:48:41] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:48:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:48:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 05:48:41] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:48:41] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:48:41] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 30 ms :[p2]
Stuttering acceptance computed with spot in 37 ms :[p2]
Stuttering acceptance computed with spot in 34 ms :[p2]
Product exploration explored 100000 steps with 4676 reset in 233 ms.
Product exploration explored 100000 steps with 4712 reset in 253 ms.
Built C files in :
/tmp/ltsmin1965731865264248933
[2024-05-22 05:48:42] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-05-22 05:48:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:48:42] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-05-22 05:48:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:48:42] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-05-22 05:48:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:48:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1965731865264248933
Running compilation step : cd /tmp/ltsmin1965731865264248933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin1965731865264248933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1965731865264248933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1325744334430841300.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 247/247 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 285 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 246
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 0 with 2 rules applied. Total rules applied 4 place count 283 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 282 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 282 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 14 place count 282 transition count 236
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 16 place count 281 transition count 235
Applied a total of 16 rules in 22 ms. Remains 281 /285 variables (removed 4) and now considering 235/247 (removed 12) transitions.
// Phase 1: matrix 235 rows 281 cols
[2024-05-22 05:48:57] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 05:48:57] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 05:48:57] [INFO ] Invariant cache hit.
[2024-05-22 05:48:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 05:48:57] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-22 05:48:57] [INFO ] Redundant transitions in 2 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-22 05:48:57] [INFO ] Invariant cache hit.
[2024-05-22 05:48:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/516 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 0/516 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 348 constraints, problems are : Problem set: 0 solved, 232 unsolved in 12982 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/516 variables, 281/340 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 232/580 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 05:49:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:49:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:49:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 584 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 4/4 constraints]
After SMT, in 43108ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 43112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/285 places, 235/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43643 ms. Remains : 281/285 places, 235/247 transitions.
Built C files in :
/tmp/ltsmin13888198793392658505
[2024-05-22 05:49:41] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2024-05-22 05:49:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:49:41] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2024-05-22 05:49:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:49:41] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2024-05-22 05:49:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:49:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13888198793392658505
Running compilation step : cd /tmp/ltsmin13888198793392658505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin13888198793392658505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13888198793392658505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6393152523632383772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 05:49:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:49:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:49:56] [INFO ] Time to serialize gal into /tmp/LTL4327825607037755791.gal : 2 ms
[2024-05-22 05:49:56] [INFO ] Time to serialize properties into /tmp/LTL4769259563826065924.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4327825607037755791.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16873517745777857082.hoa' '-atoms' '/tmp/LTL4769259563826065924.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4769259563826065924.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16873517745777857082.hoa
Detected timeout of ITS tools.
[2024-05-22 05:50:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:50:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:50:11] [INFO ] Time to serialize gal into /tmp/LTL9907220767197302745.gal : 2 ms
[2024-05-22 05:50:11] [INFO ] Time to serialize properties into /tmp/LTL16600991414763599127.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9907220767197302745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16600991414763599127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G((F(G("((p92!=1)||(p283!=1))")))&&(F("((p301!=1)||(p310!=1))"))))||((("(p190!=1)")&&(F(("((p301!=1)||(p310!=1))")&&(F(G("((p92!...208
Formula 0 simplified : G(F(GF!"((p92!=1)||(p283!=1))" | G!"((p301!=1)||(p310!=1))") & (!"((p92!=1)||(p283!=1))" | !"(p190!=1)" | GF!"((p92!=1)||(p283!=1))"...186
Detected timeout of ITS tools.
[2024-05-22 05:50:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:50:26] [INFO ] Applying decomposition
[2024-05-22 05:50:26] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14484202108306446529.txt' '-o' '/tmp/graph14484202108306446529.bin' '-w' '/tmp/graph14484202108306446529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14484202108306446529.bin' '-l' '-1' '-v' '-w' '/tmp/graph14484202108306446529.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:50:26] [INFO ] Decomposing Gal with order
[2024-05-22 05:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:50:26] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-22 05:50:26] [INFO ] Flatten gal took : 19 ms
[2024-05-22 05:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 2 ms.
[2024-05-22 05:50:26] [INFO ] Time to serialize gal into /tmp/LTL15895698050973843728.gal : 2 ms
[2024-05-22 05:50:26] [INFO ] Time to serialize properties into /tmp/LTL3470826489981941517.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15895698050973843728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3470826489981941517.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G((F(G("((u5.p92!=1)||(u5.p283!=1))")))&&(F("((i9.u8.p301!=1)||(i8.i4.u9.p310!=1))"))))||((("(u0.p190!=1)")&&(F(("((i9.u8.p301!=...259
Formula 0 simplified : G(F(GF!"((u5.p92!=1)||(u5.p283!=1))" | G!"((i9.u8.p301!=1)||(i8.i4.u9.p310!=1))") & (!"((u5.p92!=1)||(u5.p283!=1))" | !"(u0.p190!=1)...237
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 337088 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((X(X(F(p1)))||p0))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 382 transition count 316
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 369 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 365 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 365 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 362 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 361 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 284 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 281 transition count 230
Applied a total of 230 rules in 35 ms. Remains 281 /401 variables (removed 120) and now considering 230/345 (removed 115) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 05:50:41] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 05:50:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 05:50:41] [INFO ] Invariant cache hit.
[2024-05-22 05:50:41] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-22 05:50:41] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:50:48] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:50:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:50:49] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-22 05:50:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:50:52] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:50:53] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:50:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17238 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47357ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/401 places, 230/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47814 ms. Remains : 281/401 places, 230/345 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10
Product exploration explored 100000 steps with 4690 reset in 199 ms.
Product exploration explored 100000 steps with 4615 reset in 221 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1826 resets) in 187 ms. (212 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (346 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (340 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2024-05-22 05:51:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/471 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/511 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/428 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 43/471 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 40/511 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 473 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 22 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 279/281 places, 227/230 transitions.
RANDOM walk for 40000 steps (1842 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (337 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (331 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1016586 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 2
Probabilistic random walk after 1016586 steps, saw 128472 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 05:51:34] [INFO ] Computed 59 invariants in 4 ms
All remaining problems are real, not stopping.
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) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/227 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/412 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/424 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/467 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 39/506 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 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) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 05:51:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/227 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/412 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/424 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 43/467 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/467 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 39/506 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 499 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 05:51:35] [INFO ] Invariant cache hit.
[2024-05-22 05:51:36] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 05:51:36] [INFO ] Invariant cache hit.
[2024-05-22 05:51:36] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-22 05:51:36] [INFO ] Redundant transitions in 0 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-22 05:51:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/505 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:51:42] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-22 05:51:42] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:51:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:51:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:51:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:51:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 1/506 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16886 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 227/505 variables, 278/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 223/566 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:52:18] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 567 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 7/7 constraints]
After SMT, in 47019ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 47021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47408 ms. Remains : 279/279 places, 227/227 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 279 transition count 227
Applied a total of 1 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 05:52:23] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 05:52:23] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 05:52:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:52:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:52:23] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 05:52:23] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 05:52:23] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 366 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 05:52:24] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:52:24] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 05:52:24] [INFO ] Invariant cache hit.
[2024-05-22 05:52:24] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-22 05:52:24] [INFO ] Redundant transitions in 0 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:52:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:52:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:52:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:52:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:52:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:52:34] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:52:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:52:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47385ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47808 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1855 resets) in 592 ms. (67 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (356 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (329 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2024-05-22 05:53:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/471 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/511 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/511 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 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) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/76 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/222 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/224 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/416 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/428 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 43/471 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 40/511 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 356 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 15 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 279/281 places, 227/230 transitions.
RANDOM walk for 40000 steps (1826 resets) in 497 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (337 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (339 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1059438 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 2
Probabilistic random walk after 1059438 steps, saw 133468 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 05:53:16] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
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) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/227 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/412 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/424 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 43/467 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 39/506 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/506 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 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) 61/75 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/221 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 05:53:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/227 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/229 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/412 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/424 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 43/467 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/467 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 39/506 variables, 39/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/506 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 341 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 485 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 05:53:17] [INFO ] Invariant cache hit.
[2024-05-22 05:53:17] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 05:53:17] [INFO ] Invariant cache hit.
[2024-05-22 05:53:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-22 05:53:18] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-22 05:53:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/505 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:53:24] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:53:25] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:53:25] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:53:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:53:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:53:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 1/506 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/506 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 344 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16969 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 227/505 variables, 278/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 223/566 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:54:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 567 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 278/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 7/7 constraints]
After SMT, in 47099ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 47101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47519 ms. Remains : 279/279 places, 227/227 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 279 transition count 227
Applied a total of 1 rules in 7 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 279 cols
[2024-05-22 05:54:05] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 05:54:05] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 05:54:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:54:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:54:05] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 05:54:05] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 05:54:05] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 372 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4620 reset in 201 ms.
Product exploration explored 100000 steps with 4588 reset in 257 ms.
Built C files in :
/tmp/ltsmin5692233425332077145
[2024-05-22 05:54:06] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2024-05-22 05:54:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:54:06] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2024-05-22 05:54:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:54:06] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2024-05-22 05:54:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:54:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5692233425332077145
Running compilation step : cd /tmp/ltsmin5692233425332077145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 574 ms.
Running link step : cd /tmp/ltsmin5692233425332077145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5692233425332077145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10527252101593966973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 05:54:21] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:54:21] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 05:54:21] [INFO ] Invariant cache hit.
[2024-05-22 05:54:22] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-22 05:54:22] [INFO ] Redundant transitions in 0 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:54:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:54:28] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:54:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:54:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:54:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:54:32] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:54:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:54:33] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 346 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17192 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/279 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 226/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47325ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47761 ms. Remains : 281/281 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin17921813909276178362
[2024-05-22 05:55:09] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2024-05-22 05:55:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:55:09] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2024-05-22 05:55:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:55:09] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2024-05-22 05:55:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:55:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17921813909276178362
Running compilation step : cd /tmp/ltsmin17921813909276178362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 577 ms.
Running link step : cd /tmp/ltsmin17921813909276178362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17921813909276178362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11708962131692576168.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 05:55:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:55:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:55:24] [INFO ] Time to serialize gal into /tmp/LTL10307196914547130644.gal : 2 ms
[2024-05-22 05:55:24] [INFO ] Time to serialize properties into /tmp/LTL7006388551181542542.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10307196914547130644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6991142506037630118.hoa' '-atoms' '/tmp/LTL7006388551181542542.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7006388551181542542.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6991142506037630118.hoa
Detected timeout of ITS tools.
[2024-05-22 05:55:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:55:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:55:39] [INFO ] Time to serialize gal into /tmp/LTL3896841123704568386.gal : 3 ms
[2024-05-22 05:55:39] [INFO ] Time to serialize properties into /tmp/LTL14537903668190437275.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3896841123704568386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14537903668190437275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p78==0)||(p431==0))")||(X(X(F("((p198==0)||(p281==0))"))))))))
Formula 0 simplified : G(F!"((p78==0)||(p431==0))" & FG!"((p198==0)||(p281==0))")
Detected timeout of ITS tools.
[2024-05-22 05:55:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:55:54] [INFO ] Applying decomposition
[2024-05-22 05:55:54] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14949536827319732572.txt' '-o' '/tmp/graph14949536827319732572.bin' '-w' '/tmp/graph14949536827319732572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14949536827319732572.bin' '-l' '-1' '-v' '-w' '/tmp/graph14949536827319732572.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:55:54] [INFO ] Decomposing Gal with order
[2024-05-22 05:55:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:55:54] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-22 05:55:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:55:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 4 ms.
[2024-05-22 05:55:54] [INFO ] Time to serialize gal into /tmp/LTL7944650541913733252.gal : 2 ms
[2024-05-22 05:55:54] [INFO ] Time to serialize properties into /tmp/LTL8851212498794716262.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7944650541913733252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8851212498794716262.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((u45.p78==0)||(u45.p431==0))")||(X(X(F("((i2.i1.u3.p198==0)||(i2.i1.u8.p281==0))"))))))))
Formula 0 simplified : G(F!"((u45.p78==0)||(u45.p431==0))" & FG!"((i2.i1.u3.p198==0)||(i2.i1.u8.p281==0))")
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 328383 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||G(p1)))))'
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
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 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
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 393 transition count 333
Applied a total of 20 rules in 21 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:56:09] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 05:56:10] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 05:56:10] [INFO ] Invariant cache hit.
[2024-05-22 05:56:10] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:56:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:15] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:56:15] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-22 05:56:16] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-22 05:56:16] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:56:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:56:16] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:56:16] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:56:17] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:56:17] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:56:17] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:56:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:56:18] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-22 05:56:18] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:56:18] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:56:19] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:56:24] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:56:25] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:56:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:56:25] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-22 05:56:28] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-22 05:56:29] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:56:30] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:56:38] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:43] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:56:43] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:56:43] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:56:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:56:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:56:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:56:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:56:44] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:56:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:56:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:56:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:56:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:56:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:49] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:56:52] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:56:52] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:56:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60858 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-11 finished in 61212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
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 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
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 393 transition count 333
Applied a total of 20 rules in 18 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
[2024-05-22 05:57:11] [INFO ] Invariant cache hit.
[2024-05-22 05:57:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 05:57:11] [INFO ] Invariant cache hit.
[2024-05-22 05:57:11] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:57:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:16] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:57:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:57:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:57:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:57:18] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:57:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-22 05:57:19] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:57:19] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:57:19] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:57:20] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:25] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:57:25] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:57:25] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:57:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:29] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:57:29] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:57:29] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:57:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:57:29] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:57:30] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:57:30] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:57:30] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:57:32] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:35] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:57:39] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:57:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:44] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:57:44] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:57:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:57:44] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:57:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:57:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:57:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:57:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:57:45] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:57:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:57:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:47] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:57:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:57:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:50] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:57:53] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:57:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:57:53] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60782 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-12 finished in 60938 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||(G(p2)&&p1)))))'
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 394 transition count 328
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 381 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 381 transition count 317
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 49 place count 370 transition count 317
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 367 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 367 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 367 transition count 313
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 364 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 364 transition count 307
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 362 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 218 place count 287 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 285 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 283 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 282 transition count 234
Applied a total of 225 rules in 42 ms. Remains 282 /401 variables (removed 119) and now considering 234/345 (removed 111) transitions.
// Phase 1: matrix 234 rows 282 cols
[2024-05-22 05:58:12] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 05:58:12] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 05:58:12] [INFO ] Invariant cache hit.
[2024-05-22 05:58:12] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-22 05:58:12] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-22 05:58:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 234/515 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:58:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:23] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:58:23] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:58:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:58:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:28] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 13 (OVERLAPS) 1/516 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:34] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:58:34] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:58:34] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:58:34] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:58:37] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 353 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 234/515 variables, 281/352 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 230/582 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 230 unsolved
SMT process timed out in 60137ms, After SMT, problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/401 places, 234/345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60620 ms. Remains : 282/401 places, 234/345 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLFireability-14
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 60782 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(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 397 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 394 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 394 transition count 338
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 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 393 transition count 334
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 393 transition count 333
Applied a total of 20 rules in 21 ms. Remains 393 /401 variables (removed 8) and now considering 333/345 (removed 12) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:59:12] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 05:59:13] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 05:59:13] [INFO ] Invariant cache hit.
[2024-05-22 05:59:13] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:59:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-22 05:59:18] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-22 05:59:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 3 ms to minimize.
[2024-05-22 05:59:18] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 05:59:19] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:59:19] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:59:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:59:19] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:59:19] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:59:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:59:20] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:59:20] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-22 05:59:21] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:59:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:59:22] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:26] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 05:59:26] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:59:27] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:59:31] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:59:33] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:37] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:40] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:59:40] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:59:40] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:59:41] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:59:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:59:47] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:59:47] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:59:47] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:59:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:59:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:59:49] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:59:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:52] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:59:54] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:59:55] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:59:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 393/401 places, 333/345 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 393/401 places, 333/345 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-15
Product exploration explored 100000 steps with 1730 reset in 173 ms.
Product exploration explored 100000 steps with 1752 reset in 194 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 132 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (347 resets) in 577 ms. (69 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (68 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2024-05-22 06:00:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:00:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1984 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
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 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 30 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 280/393 places, 226/333 transitions.
RANDOM walk for 40000 steps (1590 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (335 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (315 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1052973 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 2
Probabilistic random walk after 1052973 steps, saw 143641 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 06:00:21] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:00:21] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/416 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/425 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/467 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/467 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/506 variables, 39/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:00:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 184/416 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/425 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/467 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/467 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/467 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/506 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1645 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-22 06:00:23] [INFO ] Invariant cache hit.
[2024-05-22 06:00:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 06:00:23] [INFO ] Invariant cache hit.
[2024-05-22 06:00:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:00:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-22 06:00:24] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 06:00:24] [INFO ] Invariant cache hit.
[2024-05-22 06:00:24] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/505 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:00:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:00:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (OVERLAPS) 1/506 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:00:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:00:41] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/506 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:00:45] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/506 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 18 (OVERLAPS) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 351 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28635 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 226/505 variables, 279/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 222/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:01:03] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:01:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:01:12] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:01:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 576 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints]
After SMT, in 58757ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 58759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59198 ms. Remains : 280/280 places, 226/226 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 280 transition count 226
Applied a total of 1 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 06:01:23] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 06:01:23] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:01:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 06:01:23] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:01:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:01:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-22 06:01:23] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:01:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:01:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-05-22 06:01:23] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:01:23] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 454 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 269 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 6 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 06:01:24] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 06:01:24] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 06:01:24] [INFO ] Invariant cache hit.
[2024-05-22 06:01:24] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 06:01:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:29] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:01:30] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:01:31] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:01:31] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:01:31] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:01:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:01:32] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:01:32] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:01:32] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:01:33] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:38] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:01:38] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:01:38] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:01:38] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:01:38] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:01:39] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:01:39] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:01:39] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:01:39] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:01:42] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:01:43] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:01:44] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:51] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:01:52] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:01:57] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:01:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:01:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:01:57] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:01:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:01:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:01:58] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:01:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:01:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:02:00] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:02:00] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:02:01] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:02:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:02:01] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:02:04] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:02:06] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:02:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:02:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in LTL mode , in 1 iterations and 60728 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 161 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (350 resets) in 581 ms. (68 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (69 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (62 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2024-05-22 06:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/716 variables, 10/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/716 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/722 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/724 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/726 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/372 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 320/698 variables, 378/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:02:26] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/716 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/722 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/724 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/726 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/726 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2400 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 207 place count 285 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 283 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 282 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 281 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 280 transition count 226
Applied a total of 216 rules in 34 ms. Remains 280 /393 variables (removed 113) and now considering 226/333 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 280/393 places, 226/333 transitions.
RANDOM walk for 40000 steps (1669 resets) in 481 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (315 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (345 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1064163 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 2
Probabilistic random walk after 1064163 steps, saw 145232 distinct states, run finished after 3002 ms. (steps per millisecond=354 ) properties seen :0
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 06:02:32] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 06:02:32] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 184/416 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/425 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/467 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/467 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/506 variables, 39/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/506 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:02:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 184/416 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/425 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/467 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/467 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/467 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/506 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1535 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 280/280 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-22 06:02:34] [INFO ] Invariant cache hit.
[2024-05-22 06:02:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 06:02:35] [INFO ] Invariant cache hit.
[2024-05-22 06:02:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:02:35] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-22 06:02:35] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 06:02:35] [INFO ] Invariant cache hit.
[2024-05-22 06:02:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/505 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:02:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:02:43] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (OVERLAPS) 1/506 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:02:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:02:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/506 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:02:56] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/506 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 18 (OVERLAPS) 0/506 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 351 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28708 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 226/505 variables, 279/344 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 222/572 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 06:03:14] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:03:15] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:03:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:03:26] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/506 variables, and 576 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints]
After SMT, in 58820ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 58822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59229 ms. Remains : 280/280 places, 226/226 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 280 transition count 226
Applied a total of 1 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 280 cols
[2024-05-22 06:03:34] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 06:03:34] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:03:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:03:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:03:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:03:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 06:03:34] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:03:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 1
[2024-05-22 06:03:34] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:03:34] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 493 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 309 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 1725 reset in 173 ms.
Product exploration explored 100000 steps with 1720 reset in 191 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 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
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 387 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 15 place count 387 transition count 332
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 387 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 382 transition count 327
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 382 transition count 327
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 108 place count 382 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 372 transition count 320
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 372 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 372 transition count 348
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 370 transition count 342
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 138 rules in 83 ms. Remains 370 /393 variables (removed 23) and now considering 342/333 (removed -9) transitions.
[2024-05-22 06:03:36] [INFO ] Redundant transitions in 1 ms returned []
Running 341 sub problems to find dead transitions.
// Phase 1: matrix 342 rows 370 cols
[2024-05-22 06:03:36] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 06:03:36] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/370 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 5 (OVERLAPS) 342/712 variables, 370/429 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 0/712 variables, 0/445 constraints. Problems are: Problem set: 111 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 445 constraints, problems are : Problem set: 111 solved, 230 unsolved in 14513 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 370/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 111 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 13/13 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 66/349 variables, 32/45 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-22 06:03:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/46 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/46 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 14/363 variables, 14/60 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-22 06:03:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:03:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:03:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 06:03:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:03:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/65 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-22 06:03:57] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:03:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:03:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:03:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-22 06:03:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 06:03:58] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 6/71 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/71 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 338/701 variables, 363/434 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 16/450 constraints. Problems are: Problem set: 111 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 230/680 constraints. Problems are: Problem set: 111 solved, 230 unsolved
[2024-05-22 06:04:09] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-22 06:04:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:04:09] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:04:09] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:04:09] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:04:10] [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 Int declared 701/712 variables, and 686 constraints, problems are : Problem set: 111 solved, 230 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 363/370 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 230/341 constraints, Known Traps: 18/18 constraints]
After SMT, in 44663ms problems are : Problem set: 111 solved, 230 unsolved
Search for dead transitions found 111 dead transitions in 44666ms
Found 111 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 111 transitions
Dead transitions reduction (with SMT) removed 111 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 370/393 places, 231/333 transitions.
Graph (complete) has 940 edges and 370 vertex of which 284 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 284 /370 variables (removed 86) and now considering 231/231 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 284/393 places, 231/333 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44770 ms. Remains : 284/393 places, 231/333 transitions.
Built C files in :
/tmp/ltsmin4382908624614579560
[2024-05-22 06:04:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4382908624614579560
Running compilation step : cd /tmp/ltsmin4382908624614579560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 622 ms.
Running link step : cd /tmp/ltsmin4382908624614579560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4382908624614579560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8397555050610769139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 15 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 06:04:36] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 06:04:36] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 06:04:36] [INFO ] Invariant cache hit.
[2024-05-22 06:04:36] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 06:04:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:04:42] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:04:42] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:04:42] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-22 06:04:42] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:04:42] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:04:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:04:44] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:04:44] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:04:44] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:04:46] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:04:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:04:50] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:04:50] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:04:51] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:04:54] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:04:55] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:04:55] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:04:57] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:00] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:05:04] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:05:09] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:05:09] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:05:10] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:05:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:05:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:05:10] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:05:10] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:05:11] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:05:12] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:05:12] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:13] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:05:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:05:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:16] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:05:18] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 06:05:18] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:05:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin4090565877357065243
[2024-05-22 06:05:37] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4090565877357065243
Running compilation step : cd /tmp/ltsmin4090565877357065243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 645 ms.
Running link step : cd /tmp/ltsmin4090565877357065243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4090565877357065243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10663570638050135278.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:05:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:05:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:05:52] [INFO ] Time to serialize gal into /tmp/LTL1201265683837853131.gal : 2 ms
[2024-05-22 06:05:52] [INFO ] Time to serialize properties into /tmp/LTL17815667059577380135.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1201265683837853131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17225898064975795714.hoa' '-atoms' '/tmp/LTL17815667059577380135.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17815667059577380135.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17225898064975795714.hoa
Detected timeout of ITS tools.
[2024-05-22 06:06:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:06:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:06:07] [INFO ] Time to serialize gal into /tmp/LTL2851004527444506914.gal : 1 ms
[2024-05-22 06:06:07] [INFO ] Time to serialize properties into /tmp/LTL6441040990632136353.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2851004527444506914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6441040990632136353.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G((F("(p356!=1)"))&&(F("((p325!=1)||(p354!=1))"))))||((F(("((p325!=1)||(p354!=1))")&&(X(F("(p356!=1)")))))&&(G("(((p325!=1)||(...197
Formula 0 simplified : XG(F(G!"(p356!=1)" | G!"((p325!=1)||(p354!=1))") & (G(!"((p325!=1)||(p354!=1))" | XG!"(p356!=1)") | F!"(((p325!=1)||(p354!=1))||((p1...177
Detected timeout of ITS tools.
[2024-05-22 06:06:22] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:06:22] [INFO ] Applying decomposition
[2024-05-22 06:06:22] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6587289521498157724.txt' '-o' '/tmp/graph6587289521498157724.bin' '-w' '/tmp/graph6587289521498157724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6587289521498157724.bin' '-l' '-1' '-v' '-w' '/tmp/graph6587289521498157724.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:06:22] [INFO ] Decomposing Gal with order
[2024-05-22 06:06:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:06:22] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 06:06:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:06:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:06:22] [INFO ] Time to serialize gal into /tmp/LTL11848411854648692806.gal : 2 ms
[2024-05-22 06:06:22] [INFO ] Time to serialize properties into /tmp/LTL17810664623111149043.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11848411854648692806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17810664623111149043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G((F("(i7.u53.p356!=1)"))&&(F("((i7.i1.u40.p325!=1)||(i7.u52.p354!=1))"))))||((F(("((i7.i1.u40.p325!=1)||(i7.u52.p354!=1))")&&...274
Formula 0 simplified : XG(F(G!"(i7.u53.p356!=1)" | G!"((i7.i1.u40.p325!=1)||(i7.u52.p354!=1))") & (G(!"((i7.i1.u40.p325!=1)||(i7.u52.p354!=1))" | XG!"(i7.u...254
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 444607 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 ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(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' '!(G((F(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&F(p3)&&(!p0 U (p1||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(((!p0&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
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((X(X(F(p1)))||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' '!(X(F(((F((!p0&&X(F(p1))))&&G(!p2))||G((F(p1)&&F(!p0)))))))'
Found a Shortening insensitive property : DES-PT-40b-LTLFireability-15
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 401/401 places, 345/345 transitions.
Graph (complete) has 904 edges and 401 vertex of which 395 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 394 transition count 329
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 382 transition count 329
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 382 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 370 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 366 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 366 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 362 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 70 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 360 transition count 303
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 221 place count 286 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 282 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 281 transition count 229
Applied a total of 228 rules in 47 ms. Remains 281 /401 variables (removed 120) and now considering 229/345 (removed 116) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 06:06:38] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 06:06:38] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 06:06:38] [INFO ] Invariant cache hit.
[2024-05-22 06:06:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:06:38] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-22 06:06:38] [INFO ] Invariant cache hit.
[2024-05-22 06:06:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:06:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:06:53] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20391 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:07:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:07:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:07:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 50500ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50502ms
Starting structural reductions in LI_LTL mode, iteration 1 : 281/401 places, 229/345 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 50999 ms. Remains : 281/401 places, 229/345 transitions.
Running random walk in product with property : DES-PT-40b-LTLFireability-15
Product exploration explored 100000 steps with 8150 reset in 220 ms.
Product exploration explored 100000 steps with 8145 reset in 239 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 144 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1879 resets) in 446 ms. (89 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (352 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (379 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-05-22 06:07:30] [INFO ] Invariant cache hit.
[2024-05-22 06:07:30] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/428 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/470 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/470 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/510 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/428 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/470 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/470 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 40/510 variables, 40/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2937 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 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 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
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 280 transition count 227
Applied a total of 4 rules in 13 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 280/281 places, 227/229 transitions.
RANDOM walk for 40000 steps (1799 resets) in 734 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (360 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (353 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 991425 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 2
Probabilistic random walk after 991425 steps, saw 136268 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 06:07:37] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 06:07:37] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/426 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/468 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/468 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/507 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:07:37] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 185/417 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/426 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/468 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/468 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/507 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 881 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 06:07:39] [INFO ] Invariant cache hit.
[2024-05-22 06:07:39] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 06:07:39] [INFO ] Invariant cache hit.
[2024-05-22 06:07:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:07:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-22 06:07:39] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-22 06:07:39] [INFO ] Invariant cache hit.
[2024-05-22 06:07:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 227/506 variables, 279/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:07:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:07:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:07:53] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 1/507 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22421 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/506 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:08:11] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:08:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:08:20] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:08:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:08:23] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 8/8 constraints]
After SMT, in 52531ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 52535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53023 ms. Remains : 280/280 places, 227/227 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 280 transition count 227
Applied a total of 1 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 06:08:32] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 06:08:32] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 06:08:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:08:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:08:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 06:08:32] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 06:08:32] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:08:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
TRAPS : Iteration 1
[2024-05-22 06:08:32] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:08:32] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 451 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 306 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 2 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 06:08:33] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 06:08:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 06:08:33] [INFO ] Invariant cache hit.
[2024-05-22 06:08:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:08:33] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-22 06:08:33] [INFO ] Invariant cache hit.
[2024-05-22 06:08:33] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:08:41] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:08:47] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 19892 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:09:09] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:09:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:09:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 50017ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50019ms
Finished structural reductions in LTL mode , in 1 iterations and 50473 ms. Remains : 281/281 places, 229/229 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 153 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1868 resets) in 642 ms. (62 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (364 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (366 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
[2024-05-22 06:09:24] [INFO ] Invariant cache hit.
[2024-05-22 06:09:24] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/428 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/470 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/470 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/510 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/197 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/227 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 187/419 variables, 232/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/428 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/470 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/470 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/470 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 40/510 variables, 40/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2912 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 229/229 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 281 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 227
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 280 transition count 227
Applied a total of 4 rules in 13 ms. Remains 280 /281 variables (removed 1) and now considering 227/229 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 280/281 places, 227/229 transitions.
RANDOM walk for 40000 steps (1803 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (359 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (351 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1014732 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 2
Probabilistic random walk after 1014732 steps, saw 139143 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 06:09:31] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 06:09:31] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 185/417 variables, 232/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/426 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/468 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/468 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 39/507 variables, 39/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/160 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 41/201 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/227 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 06:09:31] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/232 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 185/417 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/426 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/468 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/468 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/507 variables, 39/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 2 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 865 ms.
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 280/280 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 06:09:32] [INFO ] Invariant cache hit.
[2024-05-22 06:09:33] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 06:09:33] [INFO ] Invariant cache hit.
[2024-05-22 06:09:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:09:33] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 06:09:33] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-22 06:09:33] [INFO ] Invariant cache hit.
[2024-05-22 06:09:33] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 1/277 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/279 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 227/506 variables, 279/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:09:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:09:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:09:47] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 1/507 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 0/507 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 348 constraints, problems are : Problem set: 0 solved, 223 unsolved in 22150 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 1/277 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 2/279 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 227/506 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 06:10:05] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:10:11] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:10:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:10:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:10:16] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 279/280 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 8/8 constraints]
After SMT, in 52277ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 52280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52779 ms. Remains : 280/280 places, 227/227 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 280 transition count 227
Applied a total of 1 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 280 cols
[2024-05-22 06:10:25] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 06:10:25] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 06:10:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 06:10:25] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 06:10:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 06:10:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 06:10:26] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 06:10:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:10:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 1
[2024-05-22 06:10:26] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 06:10:26] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 453 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 291 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 8104 reset in 218 ms.
Product exploration explored 100000 steps with 8034 reset in 233 ms.
Applying partial POR strategy [false, false, true, false, true, false]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, (NOT p1)]
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 06:10:27] [INFO ] Redundant transitions in 0 ms returned []
Running 225 sub problems to find dead transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 06:10:27] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 06:10:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 1/510 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:10:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:10:43] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 22062 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:11:00] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:11:01] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:11:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:11:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:11:06] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:11:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:11:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:11:11] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 579 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 10/10 constraints]
After SMT, in 52185ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 52187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52200 ms. Remains : 281/281 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin11705989433251422296
[2024-05-22 06:11:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11705989433251422296
Running compilation step : cd /tmp/ltsmin11705989433251422296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 539 ms.
Running link step : cd /tmp/ltsmin11705989433251422296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11705989433251422296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9995958741894747563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Applied a total of 0 rules in 6 ms. Remains 281 /281 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 06:11:35] [INFO ] Invariant cache hit.
[2024-05-22 06:11:35] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 06:11:35] [INFO ] Invariant cache hit.
[2024-05-22 06:11:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:11:35] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-22 06:11:35] [INFO ] Invariant cache hit.
[2024-05-22 06:11:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 2/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:11:43] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/510 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:11:49] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 19392 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 06:12:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:12:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:12:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints]
After SMT, in 49513ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 49515ms
Finished structural reductions in LTL mode , in 1 iterations and 49962 ms. Remains : 281/281 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin10270130482457870110
[2024-05-22 06:12:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10270130482457870110
Running compilation step : cd /tmp/ltsmin10270130482457870110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin10270130482457870110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10270130482457870110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15027621049914418957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:12:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 06:12:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:12:40] [INFO ] Time to serialize gal into /tmp/LTL13346485815980271560.gal : 2 ms
[2024-05-22 06:12:40] [INFO ] Time to serialize properties into /tmp/LTL18296996969199055081.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13346485815980271560.gal' '-t' 'CGAL' '-hoa' '/tmp/aut250188315771647478.hoa' '-atoms' '/tmp/LTL18296996969199055081.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18296996969199055081.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut250188315771647478.hoa
Detected timeout of ITS tools.
[2024-05-22 06:12:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:12:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:12:55] [INFO ] Time to serialize gal into /tmp/LTL15523246914358787431.gal : 2 ms
[2024-05-22 06:12:55] [INFO ] Time to serialize properties into /tmp/LTL11636327464760054006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15523246914358787431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11636327464760054006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G((F("(p356!=1)"))&&(F("((p325!=1)||(p354!=1))"))))||((F(("((p325!=1)||(p354!=1))")&&(X(F("(p356!=1)")))))&&(G("(((p325!=1)||(...197
Formula 0 simplified : XG(F(G!"(p356!=1)" | G!"((p325!=1)||(p354!=1))") & (G(!"((p325!=1)||(p354!=1))" | XG!"(p356!=1)") | F!"(((p325!=1)||(p354!=1))||((p1...177
Detected timeout of ITS tools.
[2024-05-22 06:13:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:13:10] [INFO ] Applying decomposition
[2024-05-22 06:13:10] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7752959462765327383.txt' '-o' '/tmp/graph7752959462765327383.bin' '-w' '/tmp/graph7752959462765327383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7752959462765327383.bin' '-l' '-1' '-v' '-w' '/tmp/graph7752959462765327383.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:13:10] [INFO ] Decomposing Gal with order
[2024-05-22 06:13:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:13:10] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 06:13:10] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:13:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2024-05-22 06:13:10] [INFO ] Time to serialize gal into /tmp/LTL14242159023117324190.gal : 2 ms
[2024-05-22 06:13:10] [INFO ] Time to serialize properties into /tmp/LTL13129036424629283346.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14242159023117324190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13129036424629283346.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G((F("(i5.u26.p356!=1)"))&&(F("((i6.i1.u17.p325!=1)||(i6.i1.u25.p354!=1))"))))||((F(("((i6.i1.u17.p325!=1)||(i6.i1.u25.p354!=1...277
Formula 0 simplified : XG(F(G!"(i5.u26.p356!=1)" | G!"((i6.i1.u17.p325!=1)||(i6.i1.u25.p354!=1))") & (G(!"((i6.i1.u17.p325!=1)||(i6.i1.u25.p354!=1))" | XG!...257
Reverse transition relation is NOT exact ! Due to transitions t114_t126, t339_t79, t7_t48_t39, t307_t34, t306_t25, t105_t107_t125_t344_t132_t129_t115, t105...820
Detected timeout of ITS tools.
Treatment of property DES-PT-40b-LTLFireability-15 finished in 407695 ms.
[2024-05-22 06:13:25] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5297050254555333996
[2024-05-22 06:13:25] [INFO ] Computing symmetric may disable matrix : 345 transitions.
[2024-05-22 06:13:25] [INFO ] Applying decomposition
[2024-05-22 06:13:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:25] [INFO ] Computing symmetric may enable matrix : 345 transitions.
[2024-05-22 06:13:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:13:25] [INFO ] Computing Do-Not-Accords matrix : 345 transitions.
[2024-05-22 06:13:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5297050254555333996
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5935400996849917959.txt' '-o' '/tmp/graph5935400996849917959.bin' '-w' '/tmp/graph5935400996849917959.weights'
Running compilation step : cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5935400996849917959.bin' '-l' '-1' '-v' '-w' '/tmp/graph5935400996849917959.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:13:25] [INFO ] Decomposing Gal with order
[2024-05-22 06:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:13:25] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 06:13:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:13:25] [INFO ] Time to serialize gal into /tmp/LTLFireability3443870051874736553.gal : 3 ms
[2024-05-22 06:13:25] [INFO ] Time to serialize properties into /tmp/LTLFireability170183890672409649.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3443870051874736553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability170183890672409649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 6 LTL properties
Checking formula 0 : !((((X(!("((i11.u81.p85==1)&&(i11.u81.p431==1))")))U(((X(!("((i11.u81.p85==1)&&(i11.u81.p431==1))")))&&(G((!("((i11.u81.p85==1)&&(i11....813
Formula 0 simplified : "((u12.p158==1)&&(u12.p189==1))" U (X"((i11.u81.p85==1)&&(i11.u81.p431==1))" R (XF"((i11.u81.p85==1)&&(i11.u81.p431==1))" & (X"((i11...272
Compilation finished in 850 ms.
Running link step : cd /tmp/ltsmin5297050254555333996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(LTLAPp6==true))) U ([]((!(LTLAPp5==true) U ((LTLAPp6==true)||[](!(LTLAPp5==true)))))||(<>((LTLAPp7==true))&&<>((LTLAPp8==true))&&(!(LTLAPp5==true) U ((LTLAPp6==true)||[](!(LTLAPp5==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t116, t256, t306, t307, t339, u12.t217, u12.t218, u12.t219, u12.t220, u12.t221, u12....1164
Computing Next relation with stutter on 2.99194e+08 deadlock states
LTSmin run took 79062 ms.
FORMULA DES-PT-40b-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5297050254555333996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((!(LTLAPp9==true)&&<>((!(LTLAPp10==true)&&<>([](!(LTLAPp11==true))))))||[]((<>([](!(LTLAPp11==true)))&&<>(!(LTLAPp10==true))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DES-PT-40b, 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 r092-tall-171624189900724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;