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.r091-tall-171624188300739.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 greatspnxred
Input is DES-PT-50b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 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 127K 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-50b-LTLCardinality-00
FORMULA_NAME DES-PT-50b-LTLCardinality-01
FORMULA_NAME DES-PT-50b-LTLCardinality-02
FORMULA_NAME DES-PT-50b-LTLCardinality-03
FORMULA_NAME DES-PT-50b-LTLCardinality-04
FORMULA_NAME DES-PT-50b-LTLCardinality-05
FORMULA_NAME DES-PT-50b-LTLCardinality-06
FORMULA_NAME DES-PT-50b-LTLCardinality-07
FORMULA_NAME DES-PT-50b-LTLCardinality-08
FORMULA_NAME DES-PT-50b-LTLCardinality-09
FORMULA_NAME DES-PT-50b-LTLCardinality-10
FORMULA_NAME DES-PT-50b-LTLCardinality-11
FORMULA_NAME DES-PT-50b-LTLCardinality-12
FORMULA_NAME DES-PT-50b-LTLCardinality-13
FORMULA_NAME DES-PT-50b-LTLCardinality-14
FORMULA_NAME DES-PT-50b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716326891118

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:28:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 21:28:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:28:12] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-21 21:28:12] [INFO ] Transformed 479 places.
[2024-05-21 21:28:12] [INFO ] Transformed 430 transitions.
[2024-05-21 21:28:12] [INFO ] Found NUPN structural information;
[2024-05-21 21:28:12] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-50b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 477 transition count 430
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 457 transition count 410
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 457 transition count 410
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 446 transition count 399
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 446 transition count 399
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 446 transition count 390
Applied a total of 73 rules in 125 ms. Remains 446 /479 variables (removed 33) and now considering 390/430 (removed 40) transitions.
// Phase 1: matrix 390 rows 446 cols
[2024-05-21 21:28:12] [INFO ] Computed 63 invariants in 52 ms
[2024-05-21 21:28:13] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-21 21:28:13] [INFO ] Invariant cache hit.
[2024-05-21 21:28:13] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2024-05-21 21:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/446 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 390/836 variables, 446/509 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:28:23] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 12 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 3 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 4 ms to minimize.
[2024-05-21 21:28:24] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 3 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:28:25] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:28:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:28:26] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:28:26] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:28:26] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 19/528 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:28:36] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:28:36] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:28:37] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:28:37] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:28:37] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:28:38] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:28:39] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:28:39] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-21 21:28:39] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:28:39] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:28:40] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:28:41] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:28:41] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 13/541 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 541 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/446 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 32/95 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 6 ms to minimize.
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:28:47] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:28:48] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:28:49] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:28:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:28:50] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:28:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:28:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:28:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:28:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:28:55] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:28:56] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:28:56] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:28:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:29:02] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-21 21:29:08] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:29:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/836 variables, and 128 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/389 constraints, Known Traps: 65/65 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Starting structural reductions in LTL mode, iteration 1 : 446/479 places, 390/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61408 ms. Remains : 446/479 places, 390/430 transitions.
Support contains 41 out of 446 places after structural reductions.
[2024-05-21 21:29:14] [INFO ] Flatten gal took : 58 ms
[2024-05-21 21:29:14] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:29:14] [INFO ] Input system was already deterministic with 390 transitions.
RANDOM walk for 40000 steps (350 resets) in 1414 ms. (28 steps per ms) remains 10/20 properties
BEST_FIRST walk for 40004 steps (51 resets) in 295 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (54 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (49 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (52 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
[2024-05-21 21:29:15] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 138/208 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 229/437 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 383/820 variables, 437/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 10/830 variables, 6/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/832 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/834 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/836 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/836 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/836 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 509 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 138/208 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:29:16] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 229/437 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 383/820 variables, 437/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:18] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:29:18] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:29:18] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:29:18] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:29:18] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:29:19] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:29:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:29:19] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:20] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:20] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:29:20] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:29:21] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:29:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-21 21:29:21] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:29:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/836 variables, and 527 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 437/446 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 18/18 constraints]
After SMT, in 6304ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 444 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 427 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 427 transition count 359
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 417 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 413 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 413 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 413 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 410 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 410 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 410 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 74 place count 410 transition count 347
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 78 place count 408 transition count 347
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 222 place count 336 transition count 275
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 230 place count 332 transition count 284
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 332 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 330 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 329 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 328 transition count 281
Applied a total of 236 rules in 164 ms. Remains 328 /446 variables (removed 118) and now considering 281/390 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 328/446 places, 281/390 transitions.
RANDOM walk for 40000 steps (1656 resets) in 657 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (264 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (264 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (257 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (288 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (264 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (271 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (288 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (269 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (270 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (252 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 554789 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 10
Probabilistic random walk after 554789 steps, saw 116431 distinct states, run finished after 3020 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 281 rows 328 cols
[2024-05-21 21:29:25] [INFO ] Computed 63 invariants in 17 ms
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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 252/292 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 28/320 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/322 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 281/603 variables, 322/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/609 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/609 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 252/292 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 28/320 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:26] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/322 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 281/603 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:27] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:28] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:29:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 6/609 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/609 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/609 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 21:29:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/609 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/609 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 406 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6263 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 7027ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 33488 ms.
Support contains 21 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 16 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 328/328 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 10 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-05-21 21:30:05] [INFO ] Invariant cache hit.
[2024-05-21 21:30:06] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:30:06] [INFO ] Invariant cache hit.
[2024-05-21 21:30:06] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-21 21:30:06] [INFO ] Redundant transitions in 15 ms returned []
Running 277 sub problems to find dead transitions.
[2024-05-21 21:30:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 281/609 variables, 328/391 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 21:30:16] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:30:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:30:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:30:17] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:30:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 21:30:19] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 21:30:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:30:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:30:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-21 21:30:28] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:30:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/609 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 402 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 281/609 variables, 328/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 277/679 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/609 variables, and 679 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60808 ms. Remains : 328/328 places, 281/281 transitions.
Computed a total of 258 stabilizing places and 250 stable transitions
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.16 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(p1))||X(X(X(G(p2)))))))'
Support contains 7 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 61 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-21 21:31:06] [INFO ] Computed 62 invariants in 21 ms
[2024-05-21 21:31:07] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 21:31:07] [INFO ] Invariant cache hit.
[2024-05-21 21:31:07] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-21 21:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:17] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:31:17] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:31:18] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:31:20] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:31:20] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:31:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-21 21:31:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:31:21] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:31:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:31:21] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 10/507 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:36] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/811 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 4901.0 5000.0))
(s5 (/ 99.0 5000.0))
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 (/ 49.0 50.0))
(s55 (/ 1.0 50.0))
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 timeout
0.0)
(s67 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 508 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:40] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:31:40] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:31:41] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:31:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:45] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:31:45] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:31:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:31:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:31:45] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:31:49] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:31:52] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:31:53] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 376/811 variables, 435/543 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/811 variables, 375/918 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 918 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 46/46 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61047 ms. Remains : 435/446 places, 376/390 transitions.
Stuttering acceptance computed with spot in 592 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 206 ms.
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 13 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-00 finished in 62114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 35 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-21 21:32:09] [INFO ] Computed 62 invariants in 18 ms
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
[2024-05-21 21:32:09] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:32:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:16] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:32:16] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:32:16] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:32:17] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:32:18] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:32:19] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-21 21:32:19] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:32:21] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:32:22] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:26] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:32:29] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:32:29] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:32:30] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:32:30] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:32:30] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:32:30] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:32:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:32:46] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:32:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:32:48] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:49] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:53] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:32:53] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:32:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:32:56] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60933 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-01
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-01 finished in 61028 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 (F(G(p1))||((!p0||F(G(p1)))&&X(!p2))||G(!p0))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 19 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-21 21:33:10] [INFO ] Computed 62 invariants in 15 ms
[2024-05-21 21:33:10] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 21:33:10] [INFO ] Invariant cache hit.
[2024-05-21 21:33:10] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-21 21:33:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:33:20] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:33:21] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 21:33:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:33:24] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:33:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:33:25] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:33:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:33:25] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:33:25] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:33:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:33:26] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:33:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:33:27] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:33:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 11/528 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:33:32] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:33:33] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:33:34] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 535 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-21 21:33:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:33:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 21:33:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:33:44] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:33:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:33:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:33:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 376/811 variables, 435/542 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 375/917 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 917 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 45/45 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60988 ms. Remains : 435/446 places, 376/390 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-02
Product exploration explored 100000 steps with 902 reset in 262 ms.
Product exploration explored 100000 steps with 894 reset in 289 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/435 stabilizing places and 248/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 272 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
RANDOM walk for 40000 steps (356 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1298084 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1298084 steps, saw 208751 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
[2024-05-21 21:34:15] [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) 238/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/340 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/420 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 363/783 variables, 420/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/801 variables, 10/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/807 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/807 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/809 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/811 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/811 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 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) 238/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/340 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/420 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 363/783 variables, 420/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:34:15] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/783 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/801 variables, 10/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/807 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:34:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/807 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/807 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/809 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/809 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/811 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/811 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/811 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 355 ms.
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 429 transition count 354
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 412 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 412 transition count 343
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 401 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 400 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 400 transition count 342
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 399 transition count 341
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 399 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 399 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 399 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 398 transition count 339
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 3 with 154 rules applied. Total rules applied 220 place count 321 transition count 262
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 3 with 4 rules applied. Total rules applied 224 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 316 transition count 262
Applied a total of 229 rules in 77 ms. Remains 316 /435 variables (removed 119) and now considering 262/376 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 316/435 places, 262/376 transitions.
RANDOM walk for 40000 steps (1918 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (385 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1607567 steps, run timeout after 3001 ms. (steps per millisecond=535 ) properties seen :0 out of 1
Probabilistic random walk after 1607567 steps, saw 222312 distinct states, run finished after 3001 ms. (steps per millisecond=535 ) properties seen :0
// Phase 1: matrix 262 rows 316 cols
[2024-05-21 21:34:19] [INFO ] Computed 60 invariants in 10 ms
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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/475 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/477 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/529 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/578 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:34:19] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/475 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/477 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/529 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/529 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/578 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/578 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/578 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-21 21:34:20] [INFO ] Invariant cache hit.
[2024-05-21 21:34:20] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 21:34:20] [INFO ] Invariant cache hit.
[2024-05-21 21:34:20] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-21 21:34:20] [INFO ] Redundant transitions in 4 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-21 21:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/577 variables, 315/375 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 21:34:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:34:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:34:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:34:27] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 21:34:30] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 21:34:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:34:35] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 21:34:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 1/578 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 391 constraints, problems are : Problem set: 0 solved, 259 unsolved in 29139 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 262/577 variables, 315/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 259/649 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 649 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 15/15 constraints]
After SMT, in 59320ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59828 ms. Remains : 316/316 places, 262/262 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 316 transition count 262
Applied a total of 1 rules in 13 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 316 cols
[2024-05-21 21:35:19] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 21:35:20] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:35:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 21:35:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 21:35:20] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:35:20] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:35:20] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 262 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 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 2 out of 435 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 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 428 transition count 357
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 413 transition count 357
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 413 transition count 346
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 402 transition count 346
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 203 place count 327 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 323 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 321 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 320 transition count 278
Applied a total of 214 rules in 51 ms. Remains 320 /435 variables (removed 115) and now considering 278/376 (removed 98) transitions.
// Phase 1: matrix 278 rows 320 cols
[2024-05-21 21:35:20] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 21:35:20] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 21:35:20] [INFO ] Invariant cache hit.
[2024-05-21 21:35:21] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-21 21:35:21] [INFO ] Redundant transitions in 6 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-21 21:35:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 2/319 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/597 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:35:28] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:35:33] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:35:35] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 1/598 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:35:43] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:35:44] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:35:48] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:35:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 385 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 2/319 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 278/597 variables, 319/384 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 275/659 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 659 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/435 places, 278/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60773 ms. Remains : 320/435 places, 278/376 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/320 stabilizing places and 209/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 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 29 ms :[(NOT p1)]
RANDOM walk for 40000 steps (2089 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (345 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1509437 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 1509437 steps, saw 210108 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
[2024-05-21 21:36:24] [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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/250 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/257 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/480 variables, 257/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/494 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/548 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/598 variables, 50/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:36:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/250 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/257 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/480 variables, 257/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:36:25] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/494 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 54/548 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 50/598 variables, 50/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/598 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 294 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 278/278 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 320 transition count 277
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 1 with 4 rules applied. Total rules applied 5 place count 318 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 317 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 317 transition count 272
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 317 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 317 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 316 transition count 263
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 18 place count 316 transition count 263
Applied a total of 18 rules in 28 ms. Remains 316 /320 variables (removed 4) and now considering 263/278 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 316/320 places, 263/278 transitions.
RANDOM walk for 40000 steps (2099 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (390 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1578838 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :0 out of 1
Probabilistic random walk after 1578838 steps, saw 218333 distinct states, run finished after 3001 ms. (steps per millisecond=526 ) properties seen :0
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 21:36:28] [INFO ] Computed 59 invariants in 6 ms
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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/476 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/530 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/579 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:36:29] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 54/530 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/579 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:36:29] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 316/316 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-21 21:36:29] [INFO ] Invariant cache hit.
[2024-05-21 21:36:29] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 21:36:29] [INFO ] Invariant cache hit.
[2024-05-21 21:36:29] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-21 21:36:29] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-21 21:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/578 variables, 315/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:36:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:36:36] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:36:36] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:36:40] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:36:40] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:36:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:36:42] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:36:42] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:36:42] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:36:43] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:36:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/579 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 386 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24249 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/578 variables, 315/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 260/645 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 645 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 54460ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54463ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54990 ms. Remains : 316/316 places, 263/263 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 316 transition count 263
Applied a total of 1 rules in 20 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 21:37:24] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 21:37:24] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:37:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 21:37:24] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 21:37:24] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:37:24] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:37:24] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 292 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5215 reset in 214 ms.
Product exploration explored 100000 steps with 5224 reset in 239 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 278/278 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 318 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 317 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 317 transition count 273
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 317 transition count 265
Applied a total of 14 rules in 25 ms. Remains 317 /320 variables (removed 3) and now considering 265/278 (removed 13) transitions.
// Phase 1: matrix 265 rows 317 cols
[2024-05-21 21:37:25] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 21:37:25] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 21:37:25] [INFO ] Invariant cache hit.
[2024-05-21 21:37:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-21 21:37:25] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-21 21:37:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 265/581 variables, 316/374 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 21:37:32] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:37:32] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 1/582 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 21:37:38] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 21:37:49] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/582 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 379 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 265/581 variables, 316/378 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 262/640 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 640 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 4/4 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 317/320 places, 265/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60708 ms. Remains : 317/320 places, 265/278 transitions.
Treatment of property DES-PT-50b-LTLCardinality-02 finished in 316153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 415 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 410 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 410 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 410 transition count 353
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 406 transition count 349
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 406 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 406 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 406 transition count 343
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 403 transition count 343
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 232 place count 327 transition count 267
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 236 place count 325 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 323 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 322 transition count 267
Applied a total of 239 rules in 63 ms. Remains 322 /446 variables (removed 124) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 322 cols
[2024-05-21 21:38:26] [INFO ] Computed 61 invariants in 9 ms
[2024-05-21 21:38:26] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 21:38:26] [INFO ] Invariant cache hit.
[2024-05-21 21:38:26] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-21 21:38:26] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 21:38:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/322 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:38:39] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/589 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:38:40] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:38:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:38:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:38:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 388 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26619 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 4/322 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 263/651 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 56802ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 56806ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57441 ms. Remains : 322/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-04
Product exploration explored 100000 steps with 11240 reset in 187 ms.
Product exploration explored 100000 steps with 11284 reset in 270 ms.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 162 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 209 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2024-05-21 21:39:24] [INFO ] Invariant cache hit.
[2024-05-21 21:39:24] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-21 21:39:24] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 37 ms returned sat
[2024-05-21 21:39:26] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2024-05-21 21:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:39:26] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2024-05-21 21:39:26] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-21 21:39:29] [INFO ] [Nat]Absence check using state equation in 3057 ms returned sat
[2024-05-21 21:39:29] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-21 21:39:32] [INFO ] Added : 163 causal constraints over 33 iterations in 3026 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 10 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 21:39:32] [INFO ] Invariant cache hit.
[2024-05-21 21:39:32] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 21:39:32] [INFO ] Invariant cache hit.
[2024-05-21 21:39:32] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-21 21:39:32] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 21:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/322 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:39:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/589 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:39:46] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:39:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:39:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:39:51] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 388 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26298 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 4/322 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 263/651 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 56467ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 56472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57018 ms. Remains : 322/322 places, 267/267 transitions.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 130 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-21 21:40:29] [INFO ] Invariant cache hit.
[2024-05-21 21:40:30] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-21 21:40:30] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 36 ms returned sat
[2024-05-21 21:40:31] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2024-05-21 21:40:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:40:31] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-21 21:40:31] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-21 21:40:34] [INFO ] [Nat]Absence check using state equation in 3038 ms returned sat
[2024-05-21 21:40:34] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-21 21:40:37] [INFO ] Added : 163 causal constraints over 33 iterations in 2930 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11237 reset in 193 ms.
Product exploration explored 100000 steps with 11354 reset in 211 ms.
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 21:40:37] [INFO ] Invariant cache hit.
[2024-05-21 21:40:37] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 21:40:37] [INFO ] Invariant cache hit.
[2024-05-21 21:40:38] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-21 21:40:38] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 21:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/322 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:40:50] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/589 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:40:51] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:40:52] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:40:53] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:40:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 388 constraints, problems are : Problem set: 0 solved, 263 unsolved in 25840 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 4/322 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 263/651 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 56009ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 56012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56546 ms. Remains : 322/322 places, 267/267 transitions.
Treatment of property DES-PT-50b-LTLCardinality-04 finished in 188187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 436 transition count 369
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 421 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 421 transition count 358
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 411 transition count 358
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 408 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 408 transition count 355
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 405 transition count 352
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 405 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 405 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 405 transition count 346
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 402 transition count 346
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 3 with 154 rules applied. Total rules applied 227 place count 325 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 324 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 322 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 321 transition count 267
Applied a total of 232 rules in 47 ms. Remains 321 /446 variables (removed 125) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 321 cols
[2024-05-21 21:41:34] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 21:41:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 21:41:34] [INFO ] Invariant cache hit.
[2024-05-21 21:41:34] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-21 21:41:34] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-21 21:41:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/320 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 267/587 variables, 320/378 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 21:41:41] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:41:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:41:41] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:41:41] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 21:41:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 21:41:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/588 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 21:41:56] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:41:58] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 387 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 2/320 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 267/587 variables, 320/386 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 264/650 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 21:42:22] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 651 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/321 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 9/9 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 321/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60709 ms. Remains : 321/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-06
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-06 finished in 60803 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((F(p0)&&G(p1))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 415 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 411 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 411 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 411 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 408 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 408 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 408 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 408 transition count 347
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 73 place count 406 transition count 347
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 330 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 233 place count 326 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 324 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 323 transition count 278
Applied a total of 236 rules in 57 ms. Remains 323 /446 variables (removed 123) and now considering 278/390 (removed 112) transitions.
// Phase 1: matrix 278 rows 323 cols
[2024-05-21 21:42:35] [INFO ] Computed 61 invariants in 10 ms
[2024-05-21 21:42:35] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 21:42:35] [INFO ] Invariant cache hit.
[2024-05-21 21:42:35] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-21 21:42:35] [INFO ] Redundant transitions in 2 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-21 21:42:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 3/323 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/601 variables, 323/384 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:42:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/601 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 385 constraints, problems are : Problem set: 0 solved, 275 unsolved in 17137 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 3/323 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 278/601 variables, 323/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 275/660 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 660 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
After SMT, in 47322ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 47325ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/446 places, 278/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47939 ms. Remains : 323/446 places, 278/390 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-07 finished in 48107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0) U p0))))))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 20 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-21 21:43:23] [INFO ] Computed 62 invariants in 13 ms
[2024-05-21 21:43:23] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 21:43:23] [INFO ] Invariant cache hit.
[2024-05-21 21:43:24] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:43:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:43:30] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:43:30] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:43:30] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:43:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:43:32] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:43:33] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-21 21:43:33] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:43:35] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:43:35] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:43:36] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:43:40] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:43:43] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-21 21:43:43] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-21 21:43:44] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:43:44] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:43:44] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-21 21:43:44] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:43:57] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:43:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:43:59] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:44:00] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:44:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:44:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:44:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:44:00] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:44:02] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:44:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:44:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:44:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-21 21:44:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:44:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:44:07] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:44:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:44:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:44:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60926 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (353 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (57 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1310101 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1310101 steps, saw 210517 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-05-21 21:44:28] [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) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/796 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 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) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:44:28] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:44:28] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/796 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 955 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
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 61 place count 398 transition count 339
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 211 place count 323 transition count 264
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 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
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 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 38 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 318/433 places, 264/373 transitions.
RANDOM walk for 40000 steps (1771 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (365 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1637751 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :0 out of 1
Probabilistic random walk after 1637751 steps, saw 211184 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
// Phase 1: matrix 264 rows 318 cols
[2024-05-21 21:44:33] [INFO ] Computed 60 invariants in 6 ms
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) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/582 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 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) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:44:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/582 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 371 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-21 21:44:34] [INFO ] Invariant cache hit.
[2024-05-21 21:44:34] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 21:44:34] [INFO ] Invariant cache hit.
[2024-05-21 21:44:34] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-21 21:44:34] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-21 21:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 264/581 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:44:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:44:44] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:44:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:44:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:44:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:44:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:44:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 30168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30645 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-21 21:45:04] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 21:45:04] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:45:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:45:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-21 21:45:05] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:45:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-05-21 21:45:05] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:45:05] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-21 21:45:05] [INFO ] Computed 62 invariants in 14 ms
[2024-05-21 21:45:05] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 21:45:05] [INFO ] Invariant cache hit.
[2024-05-21 21:45:06] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:45:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:45:13] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:45:14] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:45:15] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:45:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:45:15] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:45:15] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:45:15] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:45:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:45:19] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:22] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:45:26] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-21 21:45:26] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 3 ms to minimize.
[2024-05-21 21:45:27] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:45:27] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:45:27] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 21:45:27] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:39] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:45:39] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:45:39] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:45:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:45:41] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:45:42] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:45:45] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:46] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:45:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:45:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:45:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:45:46] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:45:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:45:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:45:52] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 433/433 places, 373/373 transitions.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (345 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1341567 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1341567 steps, saw 215297 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
[2024-05-21 21:46:09] [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) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/796 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 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) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:46:10] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:46:10] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/796 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 983 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
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 61 place count 398 transition count 339
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 211 place count 323 transition count 264
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 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
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 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 40 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 318/433 places, 264/373 transitions.
RANDOM walk for 40000 steps (1770 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (352 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1641856 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 1
Probabilistic random walk after 1641856 steps, saw 211617 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
// Phase 1: matrix 264 rows 318 cols
[2024-05-21 21:46:14] [INFO ] Computed 60 invariants in 8 ms
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) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/582 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 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) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:46:15] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/582 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-21 21:46:15] [INFO ] Invariant cache hit.
[2024-05-21 21:46:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 21:46:16] [INFO ] Invariant cache hit.
[2024-05-21 21:46:16] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-21 21:46:16] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-21 21:46:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 264/581 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:46:26] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:46:26] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:46:30] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:46:34] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:46:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:46:37] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:46:41] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (OVERLAPS) 1/582 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 385 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 264/581 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 260/644 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:47:08] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:47:09] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:47:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:47:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 649 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60659 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-21 21:47:16] [INFO ] Computed 60 invariants in 14 ms
[2024-05-21 21:47:16] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:47:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 21:47:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 21:47:16] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:47:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2024-05-21 21:47:16] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:47:16] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 391 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 427 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 427 transition count 372
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 427 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 422 transition count 367
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 422 transition count 367
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 422 transition count 370
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 412 transition count 360
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 412 transition count 360
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 412 transition count 388
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 85 ms. Remains 410 /433 variables (removed 23) and now considering 382/373 (removed -9) transitions.
[2024-05-21 21:47:18] [INFO ] Redundant transitions in 2 ms returned []
Running 381 sub problems to find dead transitions.
// Phase 1: matrix 382 rows 410 cols
[2024-05-21 21:47:18] [INFO ] Computed 59 invariants in 4 ms
[2024-05-21 21:47:18] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 381 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 TDEAD18 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 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 TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (OVERLAPS) 382/792 variables, 410/469 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 16/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/792 variables, 0/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 485 constraints, problems are : Problem set: 113 solved, 268 unsolved in 17885 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 410/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 13/13 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/13 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 69/390 variables, 32/45 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/45 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 14/404 variables, 14/59 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-21 21:47:40] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:47:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:47:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:47:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 4/63 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/65 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-21 21:47:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:47:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 2/67 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/67 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 378/782 variables, 404/471 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/782 variables, 16/487 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/782 variables, 268/755 constraints. Problems are: Problem set: 113 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/792 variables, and 755 constraints, problems are : Problem set: 113 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 404/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 268/381 constraints, Known Traps: 8/8 constraints]
After SMT, in 48128ms problems are : Problem set: 113 solved, 268 unsolved
Search for dead transitions found 113 dead transitions in 48133ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/433 places, 269/373 transitions.
Graph (complete) has 1114 edges and 410 vertex of which 322 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 322 /410 variables (removed 88) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 322/433 places, 269/373 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48245 ms. Remains : 322/433 places, 269/373 transitions.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-21 21:48:06] [INFO ] Computed 62 invariants in 10 ms
[2024-05-21 21:48:06] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 21:48:06] [INFO ] Invariant cache hit.
[2024-05-21 21:48:06] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:48:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:13] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:48:13] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:48:13] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:48:14] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:48:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:48:16] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:48:16] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:48:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:48:19] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:23] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:48:26] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:48:26] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-21 21:48:27] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-21 21:48:27] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:48:27] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:48:27] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:48:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:48:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:48:42] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:48:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:48:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:48:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:48:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-21 21:48:43] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:48:45] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:46] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:48:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:48:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:48:47] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:48:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:50] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:48:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:48:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:48:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 60883 ms. Remains : 433/433 places, 373/373 transitions.
Treatment of property DES-PT-50b-LTLCardinality-09 finished in 343868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X(p0)))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 18 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
[2024-05-21 21:49:07] [INFO ] Invariant cache hit.
[2024-05-21 21:49:07] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 21:49:07] [INFO ] Invariant cache hit.
[2024-05-21 21:49:07] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:49:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:14] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:49:14] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:49:14] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 5 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:49:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:49:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:49:17] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-21 21:49:17] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:19] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:49:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:49:20] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:24] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:49:27] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:49:28] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:49:41] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:49:42] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:49:43] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:49:44] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:49:44] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:49:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:49:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:49:44] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:49:46] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:47] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:49:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:49:51] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:49:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:49:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 205 steps with 2 reset in 4 ms.
FORMULA DES-PT-50b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-10 finished in 61103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 20 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
[2024-05-21 21:50:08] [INFO ] Invariant cache hit.
[2024-05-21 21:50:08] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 21:50:08] [INFO ] Invariant cache hit.
[2024-05-21 21:50:08] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-21 21:50:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:15] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-21 21:50:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:50:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:50:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:50:17] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:50:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:50:18] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:50:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:50:21] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:25] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:50:28] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 21:50:28] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:50:29] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:50:29] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:50:29] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:50:29] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:50:42] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:50:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:50:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:50:45] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-21 21:50:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:50:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 21:50:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:50:45] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 21:50:47] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:50:49] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:50:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 21:50:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:50:49] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:52] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:50:52] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:50:52] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-21 21:50:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60882 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-13 finished in 61440 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(F(p0))||G((F(p1)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 443 transition count 372
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 428 transition count 372
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 428 transition count 362
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 418 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 413 transition count 357
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 413 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 413 transition count 356
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 409 transition count 352
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 409 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 409 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 73 place count 409 transition count 346
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 406 transition count 346
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 4 with 148 rules applied. Total rules applied 227 place count 332 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 331 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 329 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 328 transition count 270
Applied a total of 232 rules in 59 ms. Remains 328 /446 variables (removed 118) and now considering 270/390 (removed 120) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-21 21:51:09] [INFO ] Computed 62 invariants in 11 ms
[2024-05-21 21:51:09] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 21:51:09] [INFO ] Invariant cache hit.
[2024-05-21 21:51:10] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 21:51:10] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-21 21:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:51:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:51:21] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:51:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:51:30] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:51:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 21:51:31] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:51:31] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:51:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:51:31] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:51:38] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/598 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:51:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 328/446 places, 270/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60808 ms. Remains : 328/446 places, 270/390 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-15
Product exploration explored 100000 steps with 5252 reset in 254 ms.
Product exploration explored 100000 steps with 5297 reset in 280 ms.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 143 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 40000 steps (1672 resets) in 289 ms. (137 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (311 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (311 resets) in 333 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (311 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (291 resets) in 482 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (313 resets) in 450 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (320 resets) in 455 ms. (87 steps per ms) remains 6/6 properties
[2024-05-21 21:52:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/597 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/598 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 390 constraints, problems are : Problem set: 0 solved, 6 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 21:52:13] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 23/311 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/318 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 12 (OVERLAPS) 266/584 variables, 318/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 1/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/597 variables, 9/388 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 3/391 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 3/394 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/598 variables, 1/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 0/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/598 variables, 0/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 395 constraints, problems are : Problem set: 2 solved, 4 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1512ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12163 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 21 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 326/328 places, 267/270 transitions.
RANDOM walk for 40000 steps (1619 resets) in 797 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (321 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (308 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (328 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (337 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 763085 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 4
Probabilistic random walk after 763085 steps, saw 101094 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
// Phase 1: matrix 267 rows 326 cols
[2024-05-21 21:52:29] [INFO ] Computed 62 invariants in 8 ms
All remaining problems are real, not stopping.
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) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/592 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/593 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 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) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 21:52:30] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/309 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 263/579 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/592 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 21:52:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/592 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/593 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 593/593 variables, and 394 constraints, problems are : Problem set: 0 solved, 4 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1440ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12346 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 21:52:43] [INFO ] Invariant cache hit.
[2024-05-21 21:52:43] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:52:43] [INFO ] Invariant cache hit.
[2024-05-21 21:52:44] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-21 21:52:44] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 21:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 3/326 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/593 variables, 326/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:52:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:52:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:52:57] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:53:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:53:03] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:53:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 397 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26747 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/323 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 267/593 variables, 326/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 263/660 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:53:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 663 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 12/12 constraints]
After SMT, in 56925ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 56929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57527 ms. Remains : 326/326 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 21:53:40] [INFO ] Invariant cache hit.
[2024-05-21 21:53:41] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 21:53:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 21:53:41] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 26 ms returned sat
[2024-05-21 21:53:41] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 21:53:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-05-21 21:53:41] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 21:53:41] [INFO ] After 631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 705 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (AND (OR p0 p2 p1) (OR p0 (NOT p3) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p2) p3)))]
Knowledge based reduction with 22 factoid took 291 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-21 21:53:42] [INFO ] Computed 62 invariants in 6 ms
[2024-05-21 21:53:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 21:53:42] [INFO ] Invariant cache hit.
[2024-05-21 21:53:42] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-21 21:53:42] [INFO ] Redundant transitions in 2 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-21 21:53:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:53:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:53:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:53:59] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:54:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:54:03] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-21 21:54:03] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 21:54:03] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:54:03] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-21 21:54:04] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:54:10] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/598 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:54:31] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60745 ms. Remains : 328/328 places, 270/270 transitions.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 177 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 40000 steps (1710 resets) in 1035 ms. (38 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (315 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (319 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (310 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (313 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
[2024-05-21 21:54:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/597 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/598 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 390 constraints, problems are : Problem set: 0 solved, 4 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 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) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/597 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 21:54:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/598 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 21:54:45] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/598 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 396 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1460ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7821 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 15 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 326/328 places, 267/270 transitions.
RANDOM walk for 40000 steps (1658 resets) in 793 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (338 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (275 resets) in 365 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (311 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (320 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 816995 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 4
Probabilistic random walk after 816995 steps, saw 107693 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
// Phase 1: matrix 267 rows 326 cols
[2024-05-21 21:54:56] [INFO ] Computed 62 invariants in 8 ms
All remaining problems are real, not stopping.
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) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/592 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/593 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 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) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/592 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/593 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/593 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 593/593 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1356ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7553 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 21:55:05] [INFO ] Invariant cache hit.
[2024-05-21 21:55:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 21:55:05] [INFO ] Invariant cache hit.
[2024-05-21 21:55:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-21 21:55:06] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-21 21:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 3/326 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/593 variables, 326/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:55:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:55:15] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 21:55:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:55:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:55:16] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:55:20] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:55:23] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:55:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:55:26] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 397 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26233 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/323 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 267/593 variables, 326/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 263/660 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 21:55:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:55:49] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:55:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 663 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 12/12 constraints]
After SMT, in 56401ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 56405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56969 ms. Remains : 326/326 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 21:56:02] [INFO ] Invariant cache hit.
[2024-05-21 21:56:02] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 21:56:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 21:56:02] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 24 ms returned sat
[2024-05-21 21:56:03] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 21:56:03] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-05-21 21:56:03] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 21:56:03] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 683 ms.
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) p3 p0)))]
Knowledge based reduction with 14 factoid took 275 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Product exploration explored 100000 steps with 5289 reset in 204 ms.
Product exploration explored 100000 steps with 5240 reset in 227 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-21 21:56:04] [INFO ] Computed 62 invariants in 7 ms
[2024-05-21 21:56:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 21:56:04] [INFO ] Invariant cache hit.
[2024-05-21 21:56:05] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-21 21:56:05] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-21 21:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:56:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:56:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:56:22] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:56:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-21 21:56:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60749 ms. Remains : 328/328 places, 270/270 transitions.
Treatment of property DES-PT-50b-LTLCardinality-15 finished in 355656 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 (F(G(p1))||((!p0||F(G(p1)))&&X(!p2))||G(!p0))))'
Found a Shortening insensitive property : DES-PT-50b-LTLCardinality-02
Stuttering acceptance computed with spot in 112 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 436 transition count 369
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 421 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 421 transition count 358
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 411 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 407 transition count 354
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 407 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 407 transition count 353
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 404 transition count 350
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 404 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 404 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 404 transition count 346
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 73 place count 402 transition count 346
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 223 place count 327 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 231 place count 323 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 321 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 234 place count 320 transition count 278
Applied a total of 234 rules in 54 ms. Remains 320 /446 variables (removed 126) and now considering 278/390 (removed 112) transitions.
// Phase 1: matrix 278 rows 320 cols
[2024-05-21 21:57:05] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 21:57:05] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 21:57:05] [INFO ] Invariant cache hit.
[2024-05-21 21:57:06] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-21 21:57:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 2/319 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/597 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:57:13] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:57:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:57:13] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:57:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 1/598 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 382 constraints, problems are : Problem set: 0 solved, 275 unsolved in 22726 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 2/319 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 278/597 variables, 319/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 275/656 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 656 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
After SMT, in 52943ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 52946ms
Starting structural reductions in LI_LTL mode, iteration 1 : 320/446 places, 278/390 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 53487 ms. Remains : 320/446 places, 278/390 transitions.
Running random walk in product with property : DES-PT-50b-LTLCardinality-02
Product exploration explored 100000 steps with 5169 reset in 214 ms.
Product exploration explored 100000 steps with 5255 reset in 230 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/320 stabilizing places and 209/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
RANDOM walk for 40000 steps (2112 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (326 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1529442 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :0 out of 1
Probabilistic random walk after 1529442 steps, saw 213465 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
[2024-05-21 21:58:02] [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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/250 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/257 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/480 variables, 257/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/494 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/548 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/598 variables, 50/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/250 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/257 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/480 variables, 257/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/494 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/494 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 54/548 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/548 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 50/598 variables, 50/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 278/278 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 320 transition count 277
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 318 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 317 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 317 transition count 272
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 317 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 317 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 316 transition count 263
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 18 place count 316 transition count 263
Applied a total of 18 rules in 23 ms. Remains 316 /320 variables (removed 4) and now considering 263/278 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 316/320 places, 263/278 transitions.
RANDOM walk for 40000 steps (2097 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (376 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1601706 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :0 out of 1
Probabilistic random walk after 1601706 steps, saw 221318 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 21:58:07] [INFO ] Computed 59 invariants in 4 ms
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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/476 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/530 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/579 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:58:07] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 54/530 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/579 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:58:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 316/316 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-21 21:58:07] [INFO ] Invariant cache hit.
[2024-05-21 21:58:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 21:58:07] [INFO ] Invariant cache hit.
[2024-05-21 21:58:08] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-21 21:58:08] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-21 21:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/578 variables, 315/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:58:14] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:58:14] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:58:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:58:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:58:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:58:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:58:18] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:58:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/579 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 383 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22364 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/578 variables, 315/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 260/642 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 21:58:57] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 643 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 9/9 constraints]
After SMT, in 52538ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53040 ms. Remains : 316/316 places, 263/263 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 316 transition count 263
Applied a total of 1 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 21:59:00] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 21:59:00] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:59:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 21:59:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 21:59:01] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 21:59:01] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:59:01] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 281 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 278 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 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 2 out of 320 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 : 320/320 places, 278/278 transitions.
Applied a total of 0 rules in 11 ms. Remains 320 /320 variables (removed 0) and now considering 278/278 (removed 0) transitions.
// Phase 1: matrix 278 rows 320 cols
[2024-05-21 21:59:01] [INFO ] Computed 58 invariants in 10 ms
[2024-05-21 21:59:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:59:01] [INFO ] Invariant cache hit.
[2024-05-21 21:59:01] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-21 21:59:01] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-21 21:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 2/319 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/597 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-21 21:59:08] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 21:59:09] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:59:09] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:59:09] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 1/598 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 382 constraints, problems are : Problem set: 0 solved, 275 unsolved in 22609 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 2/319 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 278/597 variables, 319/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 275/656 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 656 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
After SMT, in 52809ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 52812ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53315 ms. Remains : 320/320 places, 278/278 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/320 stabilizing places and 209/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 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 46 ms :[(NOT p1)]
RANDOM walk for 40000 steps (2092 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (321 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1554161 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Probabilistic random walk after 1554161 steps, saw 217206 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-21 21:59:57] [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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/250 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/257 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/480 variables, 257/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/494 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/548 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/598 variables, 50/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:59:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/250 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/257 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/480 variables, 257/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:59:58] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/494 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:59:58] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/494 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 54/548 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/548 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 50/598 variables, 50/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/598 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 294 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 278/278 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 320 transition count 277
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 1 with 4 rules applied. Total rules applied 5 place count 318 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 317 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 317 transition count 272
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 317 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 317 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 316 transition count 263
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 18 place count 316 transition count 263
Applied a total of 18 rules in 21 ms. Remains 316 /320 variables (removed 4) and now considering 263/278 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 316/320 places, 263/278 transitions.
RANDOM walk for 40000 steps (2110 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (419 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1617395 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1617395 steps, saw 223878 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 22:00:02] [INFO ] Computed 59 invariants in 8 ms
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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/476 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/530 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/579 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 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) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:00:02] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 54/530 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/579 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:00:02] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 316/316 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-21 22:00:02] [INFO ] Invariant cache hit.
[2024-05-21 22:00:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 22:00:02] [INFO ] Invariant cache hit.
[2024-05-21 22:00:03] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-05-21 22:00:03] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-21 22:00:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/578 variables, 315/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 22:00:08] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 22:00:12] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 22:00:13] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:00:14] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/579 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 383 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22685 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/578 variables, 315/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 260/642 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 22:00:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 643 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 9/9 constraints]
After SMT, in 52868ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52871ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53363 ms. Remains : 316/316 places, 263/263 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 316 transition count 263
Applied a total of 1 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-21 22:00:56] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 22:00:56] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:00:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 22:00:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:00:56] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:00:56] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:00:56] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
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 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5202 reset in 214 ms.
Product exploration explored 100000 steps with 5216 reset in 230 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 278/278 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 318 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 317 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 317 transition count 273
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 317 transition count 265
Applied a total of 14 rules in 12 ms. Remains 317 /320 variables (removed 3) and now considering 265/278 (removed 13) transitions.
// Phase 1: matrix 265 rows 317 cols
[2024-05-21 22:00:57] [INFO ] Computed 58 invariants in 11 ms
[2024-05-21 22:00:57] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 22:00:57] [INFO ] Invariant cache hit.
[2024-05-21 22:00:57] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-21 22:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-21 22:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 265/581 variables, 316/374 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 22:01:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:01:04] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:01:05] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 22:01:09] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:01:09] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 1/582 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/582 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 381 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 265/581 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 262/642 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 642 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 6/6 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 317/320 places, 265/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60720 ms. Remains : 317/320 places, 265/278 transitions.
Treatment of property DES-PT-50b-LTLCardinality-02 finished in 292487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0) U p0))))))'
Found a Shortening insensitive property : DES-PT-50b-LTLCardinality-09
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 436 transition count 369
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 421 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 421 transition count 358
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 411 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 406 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 406 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 406 transition count 352
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 402 transition count 348
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 402 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 402 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 402 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 399 transition count 342
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 230 place count 324 transition count 267
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 234 place count 322 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 320 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 319 transition count 267
Applied a total of 237 rules in 52 ms. Remains 319 /446 variables (removed 127) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 319 cols
[2024-05-21 22:01:58] [INFO ] Computed 58 invariants in 7 ms
[2024-05-21 22:01:58] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 22:01:58] [INFO ] Invariant cache hit.
[2024-05-21 22:01:58] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-21 22:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 3/318 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/585 variables, 318/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:02:04] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:02:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/586 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:02:11] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:02:12] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:02:17] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:02:17] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-21 22:02:17] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:02:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 3/318 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/585 variables, 318/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LI_LTL mode, iteration 1 : 319/446 places, 267/390 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60744 ms. Remains : 319/446 places, 267/390 transitions.
Running random walk in product with property : DES-PT-50b-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Product exploration explored 100000 steps with 25000 reset in 187 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2030 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (409 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1643335 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 1
Probabilistic random walk after 1643335 steps, saw 211870 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
[2024-05-21 22:03:02] [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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/249 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/471 variables, 256/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/484 variables, 11/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 52/536 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/586 variables, 50/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/586 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/249 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/471 variables, 256/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:03:02] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/484 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/536 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 50/586 variables, 50/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 378 ms.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 267/267 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 319 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 319 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 318 transition count 265
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 318 transition count 265
Applied a total of 4 rules in 16 ms. Remains 318 /319 variables (removed 1) and now considering 265/267 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 318/319 places, 265/267 transitions.
RANDOM walk for 40000 steps (1996 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (388 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1631046 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :0 out of 1
Probabilistic random walk after 1631046 steps, saw 210439 distinct states, run finished after 3001 ms. (steps per millisecond=543 ) properties seen :0
// Phase 1: matrix 265 rows 318 cols
[2024-05-21 22:03:06] [INFO ] Computed 59 invariants in 7 ms
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) 184/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/224 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/249 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/469 variables, 256/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/482 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 52/534 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/583 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/583 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 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) 184/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/224 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/249 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/469 variables, 256/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/482 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 52/534 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/583 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 265/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 318/318 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 265/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-21 22:03:07] [INFO ] Invariant cache hit.
[2024-05-21 22:03:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 22:03:07] [INFO ] Invariant cache hit.
[2024-05-21 22:03:07] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-21 22:03:07] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-21 22:03:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 265/582 variables, 317/376 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:03:18] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:03:18] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 1/583 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 22:03:23] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/583 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 384 constraints, problems are : Problem set: 0 solved, 261 unsolved in 24147 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 265/582 variables, 317/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 261/644 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 644 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
After SMT, in 54320ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 54323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54803 ms. Remains : 318/318 places, 265/265 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 318 transition count 265
Applied a total of 1 rules in 8 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 318 cols
[2024-05-21 22:04:02] [INFO ] Computed 59 invariants in 7 ms
[2024-05-21 22:04:02] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:04:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 22:04:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:04:02] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:04:02] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:04:02] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 313 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 267/267 (removed 0) transitions.
// Phase 1: matrix 267 rows 319 cols
[2024-05-21 22:04:02] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 22:04:03] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 22:04:03] [INFO ] Invariant cache hit.
[2024-05-21 22:04:03] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-21 22:04:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 3/318 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/585 variables, 318/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:04:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 22:04:09] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/586 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:04:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:04:17] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:04:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-21 22:04:21] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 22:04:21] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:04:25] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 3/318 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/585 variables, 318/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 60663 ms. Remains : 319/319 places, 267/267 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2056 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (390 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1640101 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :0 out of 1
Probabilistic random walk after 1640101 steps, saw 211539 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
[2024-05-21 22:05:06] [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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/249 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/471 variables, 256/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/484 variables, 11/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 52/536 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/586 variables, 50/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/586 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 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) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/249 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/471 variables, 256/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:05:07] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/484 variables, 11/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/536 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 50/586 variables, 50/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 378 ms.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 267/267 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 319 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 319 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 318 transition count 265
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 318 transition count 265
Applied a total of 4 rules in 13 ms. Remains 318 /319 variables (removed 1) and now considering 265/267 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 318/319 places, 265/267 transitions.
RANDOM walk for 40000 steps (1957 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (368 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1646323 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :0 out of 1
Probabilistic random walk after 1646323 steps, saw 212123 distinct states, run finished after 3001 ms. (steps per millisecond=548 ) properties seen :0
// Phase 1: matrix 265 rows 318 cols
[2024-05-21 22:05:10] [INFO ] Computed 59 invariants in 7 ms
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) 184/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/224 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/249 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/469 variables, 256/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/482 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 52/534 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/583 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/583 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 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) 184/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/224 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/249 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/256 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/469 variables, 256/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/482 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 52/534 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/583 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 265/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 265/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-21 22:05:11] [INFO ] Invariant cache hit.
[2024-05-21 22:05:11] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 22:05:11] [INFO ] Invariant cache hit.
[2024-05-21 22:05:12] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-21 22:05:12] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-21 22:05:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 265/582 variables, 317/376 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 22:05:21] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:05:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:05:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:05:22] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:05:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:05:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 1/583 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 22:05:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/583 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 384 constraints, problems are : Problem set: 0 solved, 261 unsolved in 23674 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 265/582 variables, 317/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 261/644 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 644 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints]
After SMT, in 53848ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 53851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54336 ms. Remains : 318/318 places, 265/265 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 318 transition count 265
Applied a total of 1 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 318 cols
[2024-05-21 22:06:06] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 22:06:06] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:06:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 22:06:06] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 22:06:06] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:06:06] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:06:06] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 298 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 179 ms.
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 267/267 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 22:06:07] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 319 cols
[2024-05-21 22:06:07] [INFO ] Computed 58 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 3/318 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/585 variables, 318/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/586 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/586 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 379 constraints, problems are : Problem set: 0 solved, 263 unsolved in 21677 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 3/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/585 variables, 318/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 263/641 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 641 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 51850ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 51853ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51867 ms. Remains : 319/319 places, 267/267 transitions.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 319 /319 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 22:06:59] [INFO ] Invariant cache hit.
[2024-05-21 22:06:59] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 22:06:59] [INFO ] Invariant cache hit.
[2024-05-21 22:06:59] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-21 22:06:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 3/318 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/585 variables, 318/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:07:05] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-21 22:07:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/586 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:07:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 22:07:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:07:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:07:18] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 22:07:18] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 22:07:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 3/318 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/585 variables, 318/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/319 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 319/319 places, 267/267 transitions.
Treatment of property DES-PT-50b-LTLCardinality-09 finished in 362210 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(F(p0))||G((F(p1)&&(!p2 U (p3||G(!p2))))))))'
[2024-05-21 22:08:00] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:08:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 22:08:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 446 places, 390 transitions and 1361 arcs took 6 ms.
Total runtime 2388049 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-50b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 446
TRANSITIONS: 390
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.001s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4988
MODEL NAME: /home/mcc/execution/412/model
446 places, 390 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50b-LTLCardinality-02 CANNOT_COMPUTE
FORMULA DES-PT-50b-LTLCardinality-04 CANNOT_COMPUTE
FORMULA DES-PT-50b-LTLCardinality-09 CANNOT_COMPUTE
FORMULA DES-PT-50b-LTLCardinality-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716329765821

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-50b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-50b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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