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.r492-smll-171636266300171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 753K 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 EisenbergMcGuire-PT-06-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717224097704

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:41:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:41:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:41:41] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2024-06-01 06:41:41] [INFO ] Transformed 414 places.
[2024-06-01 06:41:41] [INFO ] Transformed 1296 transitions.
[2024-06-01 06:41:41] [INFO ] Found NUPN structural information;
[2024-06-01 06:41:41] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 729 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 154 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 387 transition count 1134
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 387 transition count 1134
Applied a total of 54 rules in 172 ms. Remains 387 /414 variables (removed 27) and now considering 1134/1296 (removed 162) transitions.
[2024-06-01 06:41:41] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
// Phase 1: matrix 540 rows 387 cols
[2024-06-01 06:41:41] [INFO ] Computed 19 invariants in 50 ms
[2024-06-01 06:41:42] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-06-01 06:41:42] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2024-06-01 06:41:42] [INFO ] Invariant cache hit.
[2024-06-01 06:41:43] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 06:41:44] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
Running 1128 sub problems to find dead transitions.
[2024-06-01 06:41:45] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2024-06-01 06:41:45] [INFO ] Invariant cache hit.
[2024-06-01 06:41:45] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 44 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 5 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 27 places in 387 ms of which 7 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 7 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 6 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 5 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 4 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 58 places in 320 ms of which 5 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 5 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 8 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 83 places in 335 ms of which 5 ms to minimize.
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 3 ms to minimize.
[2024-06-01 06:42:08] [INFO ] Deduced a trap composed of 56 places in 474 ms of which 6 ms to minimize.
[2024-06-01 06:42:08] [INFO ] Deduced a trap composed of 55 places in 399 ms of which 5 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 4 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 6 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 6 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 72 places in 394 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:42:13] [INFO ] Deduced a trap composed of 77 places in 401 ms of which 5 ms to minimize.
[2024-06-01 06:42:13] [INFO ] Deduced a trap composed of 61 places in 358 ms of which 7 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 60 places in 437 ms of which 6 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 77 places in 359 ms of which 6 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 50 places in 341 ms of which 5 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 91 places in 369 ms of which 5 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 83 places in 308 ms of which 5 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 5 ms to minimize.
SMT process timed out in 31445ms, After SMT, problems are : Problem set: 0 solved, 1128 unsolved
Search for dead transitions found 0 dead transitions in 31509ms
Starting structural reductions in LTL mode, iteration 1 : 387/414 places, 1134/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34862 ms. Remains : 387/414 places, 1134/1296 transitions.
Support contains 28 out of 387 places after structural reductions.
[2024-06-01 06:42:17] [INFO ] Flatten gal took : 215 ms
[2024-06-01 06:42:17] [INFO ] Flatten gal took : 115 ms
[2024-06-01 06:42:17] [INFO ] Input system was already deterministic with 1134 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 1767 ms. (22 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
[2024-06-01 06:42:18] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2024-06-01 06:42:18] [INFO ] Invariant cache hit.
[2024-06-01 06:42:18] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 239/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/254 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 7 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 360/614 variables, 254/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/640 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 40/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 36/676 variables, 16/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 107/783 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/783 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/787 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/787 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/927 variables, 111/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/927 variables, 83/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/927 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/927 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 590 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 387/387 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 239/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/254 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem AtomicPropp16 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/614 variables, 254/272 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 44/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/640 variables, 6/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 1/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 40/363 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/676 variables, 16/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 12/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/676 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 107/783 variables, 4/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/783 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/787 variables, 2/397 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/787 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/787 variables, 3/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/787 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 140/927 variables, 111/512 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/927 variables, 83/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/927 variables, 0/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/927 variables, 0/595 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 595 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 387/387 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 2498ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 967
Applied a total of 304 rules in 250 ms. Remains 235 /387 variables (removed 152) and now considering 967/1134 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 235/387 places, 967/1134 transitions.
RANDOM walk for 40000 steps (8 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15279 steps, run visited all 1 properties in 150 ms. (steps per millisecond=101 )
Probabilistic random walk after 15279 steps, saw 9972 distinct states, run finished after 155 ms. (steps per millisecond=98 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(p0)&&G(p1)))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 48 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2024-06-01 06:42:21] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 06:42:21] [INFO ] Computed 19 invariants in 9 ms
[2024-06-01 06:42:22] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-01 06:42:22] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:42:22] [INFO ] Invariant cache hit.
[2024-06-01 06:42:22] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:42:24] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 06:42:24] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:42:24] [INFO ] Invariant cache hit.
[2024-06-01 06:42:24] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 13 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 5 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 4 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 39 places in 472 ms of which 6 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 81 places in 407 ms of which 6 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 109 places in 451 ms of which 6 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 92 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 76 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 6 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 6 ms to minimize.
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 5 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 87 places in 252 ms of which 5 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 81 places in 326 ms of which 5 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 67 places in 357 ms of which 5 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 96 places in 376 ms of which 5 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 79 places in 384 ms of which 5 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 94 places in 363 ms of which 5 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 99 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 5 ms to minimize.
SMT process timed out in 31021ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 31049ms
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33709 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 507 ms :[true, (NOT p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-01 finished in 34306 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(p1)&&p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 54 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2024-06-01 06:42:55] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 06:42:55] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:42:56] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-06-01 06:42:56] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:42:56] [INFO ] Invariant cache hit.
[2024-06-01 06:42:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:42:58] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:42:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:42:58] [INFO ] Invariant cache hit.
[2024-06-01 06:42:58] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 5 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 5 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 96 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 5 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 5 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 54 places in 486 ms of which 7 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 5 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 6 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 78 places in 373 ms of which 6 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 5 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 50 places in 311 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 89 places in 385 ms of which 6 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 5 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 86 places in 350 ms of which 5 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 75 places in 365 ms of which 5 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 5 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 6 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 5 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 86 places in 403 ms of which 5 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 86 places in 358 ms of which 5 ms to minimize.
[2024-06-01 06:43:28] [INFO ] Deduced a trap composed of 86 places in 316 ms of which 4 ms to minimize.
[2024-06-01 06:43:28] [INFO ] Deduced a trap composed of 102 places in 387 ms of which 5 ms to minimize.
[2024-06-01 06:43:28] [INFO ] Deduced a trap composed of 72 places in 395 ms of which 6 ms to minimize.
[2024-06-01 06:43:29] [INFO ] Deduced a trap composed of 20 places in 387 ms of which 6 ms to minimize.
SMT process timed out in 31158ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31185ms
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33438 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-04 finished in 33665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!G(p0)&&p0) U ((X(G(p1)) U p2)&&G(p0)))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 22 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2024-06-01 06:43:29] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 06:43:29] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 06:43:30] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 06:43:30] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:43:30] [INFO ] Invariant cache hit.
[2024-06-01 06:43:30] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:43:32] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 06:43:32] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:43:32] [INFO ] Invariant cache hit.
[2024-06-01 06:43:32] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 5 ms to minimize.
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 6 ms to minimize.
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 78 places in 350 ms of which 5 ms to minimize.
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 5 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 6 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 5 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 51 places in 493 ms of which 6 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 81 places in 477 ms of which 6 ms to minimize.
[2024-06-01 06:43:52] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 6 ms to minimize.
[2024-06-01 06:43:52] [INFO ] Deduced a trap composed of 59 places in 389 ms of which 5 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 56 places in 325 ms of which 5 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 78 places in 440 ms of which 5 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 109 places in 465 ms of which 6 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 88 places in 356 ms of which 5 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:43:55] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:43:55] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 86 places in 433 ms of which 6 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 75 places in 441 ms of which 6 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 83 places in 447 ms of which 6 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 79 places in 436 ms of which 6 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 87 places in 434 ms of which 6 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 42 places in 422 ms of which 5 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 102 places in 397 ms of which 5 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 57 places in 368 ms of which 5 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 6 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:44:02] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 52 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 33/52 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 96 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 92 places in 391 ms of which 6 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 100 places in 414 ms of which 5 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 88 places in 358 ms of which 5 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 86 places in 342 ms of which 5 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 70 places in 395 ms of which 5 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 142 places in 435 ms of which 6 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 101 places in 434 ms of which 6 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 108 places in 381 ms of which 5 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 111 places in 441 ms of which 6 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 94 places in 438 ms of which 6 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 105 places in 431 ms of which 6 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 91 places in 443 ms of which 6 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 73 places in 378 ms of which 5 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 6 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 78 places in 392 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 84 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 99 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:44:17] [INFO ] Deduced a trap composed of 114 places in 443 ms of which 6 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 45 places in 437 ms of which 6 ms to minimize.
[2024-06-01 06:44:18] [INFO ] Deduced a trap composed of 56 places in 352 ms of which 5 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 71 places in 390 ms of which 6 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 55 places in 397 ms of which 6 ms to minimize.
[2024-06-01 06:44:19] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 5 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 5 ms to minimize.
[2024-06-01 06:44:20] [INFO ] Deduced a trap composed of 56 places in 372 ms of which 5 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 96 places in 375 ms of which 5 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 120 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 5 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 41 places in 400 ms of which 6 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 5 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 5 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 77 places in 346 ms of which 5 ms to minimize.
[2024-06-01 06:44:27] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 5 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 44 places in 326 ms of which 5 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 5 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 56 places in 304 ms of which 6 ms to minimize.
[2024-06-01 06:44:30] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 55 places in 305 ms of which 3 ms to minimize.
[2024-06-01 06:44:31] [INFO ] Deduced a trap composed of 110 places in 296 ms of which 3 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 103 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 84/84 constraints]
After SMT, in 60592ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63241 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 355 steps with 0 reset in 19 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-06 finished in 63653 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)&&F(G(p1)))))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 2 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 148 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2024-06-01 06:44:33] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 06:44:33] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:44:33] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-06-01 06:44:33] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:44:33] [INFO ] Invariant cache hit.
[2024-06-01 06:44:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:44:35] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2024-06-01 06:44:35] [INFO ] Redundant transitions in 118 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 06:44:35] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:44:35] [INFO ] Invariant cache hit.
[2024-06-01 06:44:35] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 3 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 3 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:44:54] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
[2024-06-01 06:44:54] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 5 ms to minimize.
[2024-06-01 06:44:55] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 55 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 50 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 41 places in 306 ms of which 4 ms to minimize.
[2024-06-01 06:44:57] [INFO ] Deduced a trap composed of 69 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:44:57] [INFO ] Deduced a trap composed of 59 places in 330 ms of which 4 ms to minimize.
[2024-06-01 06:44:57] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:44:58] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 4 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 82 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 73 places in 294 ms of which 3 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 62 places in 301 ms of which 4 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 62 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 4 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 50 places in 311 ms of which 6 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 50 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 3 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 6 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 3 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 3 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:45:16] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:45:17] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:45:17] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:45:17] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 79 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 50 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 3 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 59 places in 275 ms of which 3 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 3 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 60 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:45:26] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-06-01 06:45:26] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:45:26] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:45:27] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:45:27] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:45:27] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 70 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 77 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 3 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 56 places in 295 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:45:34] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:45:35] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:45:35] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:45:36] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:45:36] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 3 ms to minimize.
SMT process timed out in 60795ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63038 ms. Remains : 236/387 places, 968/1134 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-07
Product exploration explored 100000 steps with 1 reset in 525 ms.
Stack based approach found an accepted trace after 658 steps with 1 reset with depth 497 and stack size 415 in 5 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-07 finished in 63787 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||X(p1)))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 19 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2024-06-01 06:45:37] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 06:45:37] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:45:37] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-06-01 06:45:37] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:45:37] [INFO ] Invariant cache hit.
[2024-06-01 06:45:38] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:45:39] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 06:45:39] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:45:39] [INFO ] Invariant cache hit.
[2024-06-01 06:45:39] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:45:55] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:45:56] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:45:56] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 5 ms to minimize.
[2024-06-01 06:45:56] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 6 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 5 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 5 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 58 places in 342 ms of which 6 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 5 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 5 ms to minimize.
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 5 ms to minimize.
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 84 places in 354 ms of which 7 ms to minimize.
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 82 places in 331 ms of which 5 ms to minimize.
[2024-06-01 06:46:00] [INFO ] Deduced a trap composed of 78 places in 315 ms of which 5 ms to minimize.
[2024-06-01 06:46:00] [INFO ] Deduced a trap composed of 61 places in 363 ms of which 5 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 97 places in 352 ms of which 6 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 58 places in 342 ms of which 5 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 5 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 61 places in 326 ms of which 5 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 5 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 90 places in 362 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:46:03] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 74 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:46:05] [INFO ] Deduced a trap composed of 51 places in 477 ms of which 6 ms to minimize.
[2024-06-01 06:46:06] [INFO ] Deduced a trap composed of 77 places in 403 ms of which 5 ms to minimize.
[2024-06-01 06:46:06] [INFO ] Deduced a trap composed of 78 places in 433 ms of which 7 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 113 places in 416 ms of which 6 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 88 places in 402 ms of which 6 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 89 places in 330 ms of which 5 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 92 places in 372 ms of which 4 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 101 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 88 places in 359 ms of which 5 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 6 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 94 places in 338 ms of which 5 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 81 places in 343 ms of which 5 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 99 places in 349 ms of which 6 ms to minimize.
SMT process timed out in 31054ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 31077ms
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33979 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 3293 reset in 929 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-08 finished in 35128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 12 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2024-06-01 06:46:12] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 06:46:12] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:46:12] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-01 06:46:12] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:46:12] [INFO ] Invariant cache hit.
[2024-06-01 06:46:12] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:46:14] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2486 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:46:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:46:14] [INFO ] Invariant cache hit.
[2024-06-01 06:46:14] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 5 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 4 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 5 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:46:33] [INFO ] Deduced a trap composed of 96 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:46:33] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:46:33] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:46:35] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 7 ms to minimize.
[2024-06-01 06:46:35] [INFO ] Deduced a trap composed of 80 places in 437 ms of which 5 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 72 places in 390 ms of which 6 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 78 places in 413 ms of which 5 ms to minimize.
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:46:40] [INFO ] Deduced a trap composed of 89 places in 395 ms of which 5 ms to minimize.
[2024-06-01 06:46:40] [INFO ] Deduced a trap composed of 76 places in 385 ms of which 5 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 86 places in 358 ms of which 6 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 5 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 76 places in 377 ms of which 5 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 6 ms to minimize.
[2024-06-01 06:46:42] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 5 ms to minimize.
[2024-06-01 06:46:43] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 5 ms to minimize.
[2024-06-01 06:46:43] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:46:43] [INFO ] Deduced a trap composed of 86 places in 364 ms of which 5 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 86 places in 320 ms of which 6 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 102 places in 400 ms of which 5 ms to minimize.
[2024-06-01 06:46:44] [INFO ] Deduced a trap composed of 72 places in 317 ms of which 5 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 5 ms to minimize.
[2024-06-01 06:46:45] [INFO ] Deduced a trap composed of 105 places in 388 ms of which 5 ms to minimize.
SMT process timed out in 30959ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30978ms
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33482 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-11 finished in 33711 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 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 967
Applied a total of 304 rules in 131 ms. Remains 235 /387 variables (removed 152) and now considering 967/1134 (removed 167) transitions.
[2024-06-01 06:46:46] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 06:46:46] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:46:46] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-06-01 06:46:46] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 06:46:46] [INFO ] Invariant cache hit.
[2024-06-01 06:46:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:46:48] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2024-06-01 06:46:48] [INFO ] Redundant transitions in 71 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 06:46:48] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 06:46:48] [INFO ] Invariant cache hit.
[2024-06-01 06:46:48] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:46:59] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:46:59] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 3 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 3 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 4 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:47:07] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 72 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 3 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 4 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 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.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 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.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 0.0)
(s71 1.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 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 5 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 58 places in 273 ms of which 4 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 54 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 57 places in 286 ms of which 3 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 54 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 3 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:47:39] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 3 ms to minimize.
[2024-06-01 06:47:39] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 4 ms to minimize.
[2024-06-01 06:47:39] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 3 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 3 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 3 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 3 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 52 places in 276 ms of which 3 ms to minimize.
[2024-06-01 06:47:43] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:47:44] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:47:44] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 99 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 80/80 constraints]
After SMT, in 60683ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 967/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62998 ms. Remains : 235/387 places, 967/1134 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 285 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-12 finished in 63422 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((G(p1)||p0))))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 18 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2024-06-01 06:47:49] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 06:47:49] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:47:49] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-01 06:47:49] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:47:49] [INFO ] Invariant cache hit.
[2024-06-01 06:47:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:47:52] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2705 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:47:52] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:47:52] [INFO ] Invariant cache hit.
[2024-06-01 06:47:52] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 4 ms to minimize.
[2024-06-01 06:48:08] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 5 ms to minimize.
[2024-06-01 06:48:08] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:48:08] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:48:08] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 5 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 96 places in 258 ms of which 5 ms to minimize.
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 5 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 54 places in 457 ms of which 6 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 80 places in 407 ms of which 6 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 72 places in 389 ms of which 6 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 78 places in 417 ms of which 6 ms to minimize.
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:48:15] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:48:15] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:48:17] [INFO ] Deduced a trap composed of 89 places in 391 ms of which 6 ms to minimize.
[2024-06-01 06:48:17] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 9 ms to minimize.
[2024-06-01 06:48:18] [INFO ] Deduced a trap composed of 86 places in 345 ms of which 5 ms to minimize.
[2024-06-01 06:48:18] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 5 ms to minimize.
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 5 ms to minimize.
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 5 ms to minimize.
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 5 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 5 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 86 places in 310 ms of which 5 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 86 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 102 places in 361 ms of which 5 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 72 places in 382 ms of which 6 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 6 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 105 places in 422 ms of which 5 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 5 ms to minimize.
SMT process timed out in 31010ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31030ms
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33758 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-14
Product exploration explored 100000 steps with 25000 reset in 521 ms.
Product exploration explored 100000 steps with 25000 reset in 579 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 456 ms. (87 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
[2024-06-01 06:48:25] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:48:25] [INFO ] Invariant cache hit.
[2024-06-01 06:48:25] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/132 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/346 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 212/630 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/630 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/638 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/906 variables, 220/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 124/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/132 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/346 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:48:25] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 14/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 212/630 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/630 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/638 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/638 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 4 ms to minimize.
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/638 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 268/906 variables, 220/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 124/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:48:27] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:48:27] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 574 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 86 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 37322 steps, run visited all 1 properties in 306 ms. (steps per millisecond=121 )
Probabilistic random walk after 37322 steps, saw 20150 distinct states, run finished after 306 ms. (steps per millisecond=121 ) properties seen :1
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 06:48:28] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:48:28] [INFO ] Invariant cache hit.
[2024-06-01 06:48:29] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-06-01 06:48:29] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:48:29] [INFO ] Invariant cache hit.
[2024-06-01 06:48:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:48:31] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:48:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:48:31] [INFO ] Invariant cache hit.
[2024-06-01 06:48:31] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:48:48] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:48:48] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:48:48] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:48:48] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 23 places in 368 ms of which 5 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 96 places in 320 ms of which 5 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 54 places in 477 ms of which 6 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 80 places in 443 ms of which 6 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 6 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 78 places in 447 ms of which 6 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 74 places in 311 ms of which 4 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:48:56] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 5 ms to minimize.
[2024-06-01 06:48:57] [INFO ] Deduced a trap composed of 89 places in 370 ms of which 6 ms to minimize.
[2024-06-01 06:48:58] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 6 ms to minimize.
[2024-06-01 06:48:58] [INFO ] Deduced a trap composed of 86 places in 401 ms of which 5 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 75 places in 392 ms of which 5 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 5 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 6 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 6 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 86 places in 386 ms of which 6 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 5 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 5 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 102 places in 418 ms of which 6 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 72 places in 442 ms of which 5 ms to minimize.
SMT process timed out in 31216ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31239ms
Finished structural reductions in LTL mode , in 1 iterations and 34033 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-06-01 06:49:03] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:49:03] [INFO ] Invariant cache hit.
[2024-06-01 06:49:03] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/132 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/346 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 212/630 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/630 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/638 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/906 variables, 220/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 124/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/132 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/346 variables, 132/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:03] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 14/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 212/630 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/630 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/638 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/638 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:04] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:49:04] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:49:04] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/638 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 268/906 variables, 220/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 124/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:05] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:49:05] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 574 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 82 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 37322 steps, run visited all 1 properties in 298 ms. (steps per millisecond=125 )
Probabilistic random walk after 37322 steps, saw 20150 distinct states, run finished after 298 ms. (steps per millisecond=125 ) properties seen :1
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 228 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 495 ms.
Product exploration explored 100000 steps with 25000 reset in 423 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 106 Pre rules applied. Total rules applied 6 place count 384 transition count 1280
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 112 place count 384 transition count 1280
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 148 place count 384 transition count 1280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 378 transition count 1274
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 378 transition count 1274
Deduced a syphon composed of 142 places in 2 ms
Applied a total of 160 rules in 139 ms. Remains 378 /384 variables (removed 6) and now considering 1274/1116 (removed -158) transitions.
[2024-06-01 06:49:08] [INFO ] Redundant transitions in 52 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-06-01 06:49:08] [INFO ] Flow matrix only has 598 transitions (discarded 676 similar events)
// Phase 1: matrix 598 rows 378 cols
[2024-06-01 06:49:08] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:49:08] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 5 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-06-01 06:49:30] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:49:30] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 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 TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/39 constraints. Problems are: Problem set: 306 solved, 962 unsolved
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 5 ms to minimize.
[2024-06-01 06:49:32] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:49:34] [INFO ] Deduced a trap composed of 26 places in 376 ms of which 5 ms to minimize.
[2024-06-01 06:49:34] [INFO ] Deduced a trap composed of 42 places in 416 ms of which 5 ms to minimize.
[2024-06-01 06:49:35] [INFO ] Deduced a trap composed of 18 places in 496 ms of which 7 ms to minimize.
[2024-06-01 06:49:35] [INFO ] Deduced a trap composed of 11 places in 451 ms of which 9 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 65 places in 474 ms of which 6 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 5 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 44 places in 388 ms of which 6 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 52 places in 418 ms of which 6 ms to minimize.
[2024-06-01 06:49:38] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 6 ms to minimize.
[2024-06-01 06:49:38] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 6 ms to minimize.
[2024-06-01 06:49:39] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 5 ms to minimize.
[2024-06-01 06:49:39] [INFO ] Deduced a trap composed of 61 places in 349 ms of which 6 ms to minimize.
SMT process timed out in 31122ms, After SMT, problems are : Problem set: 306 solved, 962 unsolved
Search for dead transitions found 306 dead transitions in 31147ms
Found 306 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 306 transitions
Dead transitions reduction (with SMT) removed 306 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 968/1116 transitions.
Graph (complete) has 2186 edges and 378 vertex of which 236 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.8 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 236 /378 variables (removed 142) and now considering 968/968 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31412 ms. Remains : 236/384 places, 968/1116 transitions.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 12 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 06:49:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 06:49:39] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:49:40] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 06:49:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:49:40] [INFO ] Invariant cache hit.
[2024-06-01 06:49:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:49:42] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2453 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:49:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:49:42] [INFO ] Invariant cache hit.
[2024-06-01 06:49:42] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:49:57] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 4 ms to minimize.
[2024-06-01 06:49:57] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 5 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:49:59] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 5 ms to minimize.
[2024-06-01 06:50:00] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:50:00] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:50:00] [INFO ] Deduced a trap composed of 96 places in 305 ms of which 5 ms to minimize.
[2024-06-01 06:50:00] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 5 ms to minimize.
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:50:02] [INFO ] Deduced a trap composed of 54 places in 438 ms of which 6 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 80 places in 425 ms of which 6 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 5 ms to minimize.
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 78 places in 420 ms of which 6 ms to minimize.
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 5 ms to minimize.
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:50:05] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 5 ms to minimize.
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 89 places in 392 ms of which 5 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 6 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 86 places in 393 ms of which 5 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 75 places in 391 ms of which 5 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 76 places in 378 ms of which 5 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 6 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 3 places in 423 ms of which 5 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 86 places in 367 ms of which 5 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:50:11] [INFO ] Deduced a trap composed of 86 places in 385 ms of which 5 ms to minimize.
[2024-06-01 06:50:11] [INFO ] Deduced a trap composed of 86 places in 318 ms of which 5 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 102 places in 406 ms of which 5 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 72 places in 424 ms of which 5 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 20 places in 377 ms of which 6 ms to minimize.
SMT process timed out in 30842ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30861ms
Finished structural reductions in LTL mode , in 1 iterations and 33331 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-14 finished in 144042 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((G(p1)||p0))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLCardinality-14
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 381 transition count 1016
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 269 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 239 place count 266 transition count 998
Iterating global reduction 2 with 3 rules applied. Total rules applied 242 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 80 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2024-06-01 06:50:13] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 06:50:13] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:50:14] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-06-01 06:50:14] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:50:14] [INFO ] Invariant cache hit.
[2024-06-01 06:50:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:50:15] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 06:50:15] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:50:15] [INFO ] Invariant cache hit.
[2024-06-01 06:50:15] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 51 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 79 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:50:34] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:50:34] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:50:34] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:50:39] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:50:54] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:50:54] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 3 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 56 places in 319 ms of which 4 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 47 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 4 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 4 ms to minimize.
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 3 ms to minimize.
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 4 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 3 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 52 places in 334 ms of which 4 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 46 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 4 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 47 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 3 ms to minimize.
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 99 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 80/80 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Starting structural reductions in LI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62713 ms. Remains : 236/387 places, 968/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLCardinality-14
Product exploration explored 100000 steps with 25000 reset in 480 ms.
Product exploration explored 100000 steps with 25000 reset in 373 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-06-01 06:51:17] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:51:17] [INFO ] Invariant cache hit.
[2024-06-01 06:51:17] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/250 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/322 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/434 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/442 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/610 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 166/250 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/322 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 112/434 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/442 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 4 ms to minimize.
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/442 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/610 variables, 120/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 121/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 39 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 37322 steps, run visited all 1 properties in 293 ms. (steps per millisecond=127 )
Probabilistic random walk after 37322 steps, saw 20150 distinct states, run finished after 294 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 06:51:20] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:51:20] [INFO ] Invariant cache hit.
[2024-06-01 06:51:21] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-06-01 06:51:21] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:51:21] [INFO ] Invariant cache hit.
[2024-06-01 06:51:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:51:22] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 06:51:22] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:51:22] [INFO ] Invariant cache hit.
[2024-06-01 06:51:22] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:51:33] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 3 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:51:39] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:51:39] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:51:40] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:51:40] [INFO ] Deduced a trap composed of 79 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:51:41] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:51:41] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:51:41] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:51:42] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:51:45] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 4 ms to minimize.
[2024-06-01 06:51:45] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:51:45] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:51:46] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 4 ms to minimize.
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 59 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 3 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 60 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:52:03] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 06:52:03] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:52:03] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:52:04] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:52:04] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:52:04] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:52:04] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 4 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:52:06] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:52:06] [INFO ] Deduced a trap composed of 57 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:52:12] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:52:14] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 4 ms to minimize.
[2024-06-01 06:52:14] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:52:15] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:52:15] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 3 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 3 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 3 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 4 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 4 ms to minimize.
[2024-06-01 06:52:20] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:52:20] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:52:20] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:52:21] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 99 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 80/80 constraints]
After SMT, in 60789ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Finished structural reductions in LTL mode , in 1 iterations and 62773 ms. Remains : 236/236 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-06-01 06:52:24] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:52:24] [INFO ] Invariant cache hit.
[2024-06-01 06:52:24] [INFO ] State equation strengthened by 164 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 166/250 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/322 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 17/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/434 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/442 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/610 variables, 120/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/610 variables, 121/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 166/250 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/322 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 112/434 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/442 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/442 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/610 variables, 120/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 121/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1903ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 37322 steps, run visited all 1 properties in 181 ms. (steps per millisecond=206 )
Probabilistic random walk after 37322 steps, saw 20150 distinct states, run finished after 181 ms. (steps per millisecond=206 ) properties seen :1
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Product exploration explored 100000 steps with 25000 reset in 303 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 06:52:27] [INFO ] Redundant transitions in 11 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 06:52:27] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:52:27] [INFO ] Invariant cache hit.
[2024-06-01 06:52:27] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:52:34] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:52:34] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:52:34] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:52:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:52:34] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:52:35] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:52:36] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:52:40] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:52:41] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:52:42] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:52:42] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:52:42] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:52:43] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:52:52] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:52:52] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 7 ms to minimize.
[2024-06-01 06:52:52] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:52:52] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:52:53] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:52:53] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:52:53] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:52:54] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:52:54] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:52:54] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:52:55] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:52:55] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:52:55] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:52:56] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:52:56] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:52:56] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:52:56] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:52:56] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 79 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:53:04] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:53:04] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:53:04] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:53:05] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:53:05] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:05] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:53:05] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:05] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:53:16] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:53:16] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:18] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:53:18] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:26] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:53:27] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:53:27] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:53:27] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:53:27] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 60578ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60628 ms. Remains : 236/236 places, 968/968 transitions.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 06:53:28] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:53:28] [INFO ] Invariant cache hit.
[2024-06-01 06:53:28] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 06:53:28] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:53:28] [INFO ] Invariant cache hit.
[2024-06-01 06:53:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:53:29] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 06:53:29] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 06:53:29] [INFO ] Invariant cache hit.
[2024-06-01 06:53:29] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:53:39] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:53:39] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:53:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:53:41] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:53:42] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:53:53] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:53:53] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:53:53] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:53:54] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:53:55] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:53:56] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:53:56] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:53:56] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:53:56] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 79 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:54:21] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:54:21] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:54:21] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:54:21] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
SMT process timed out in 60470ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in LTL mode , in 1 iterations and 61835 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLCardinality-14 finished in 256986 ms.
[2024-06-01 06:54:30] [INFO ] Flatten gal took : 61 ms
[2024-06-01 06:54:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:54:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 387 places, 1134 transitions and 5328 arcs took 15 ms.
Total runtime 770113 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EisenbergMcGuire-PT-06-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717224870926

--------------------
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
mcc2024
ltl formula name EisenbergMcGuire-PT-06-LTLCardinality-14
ltl formula formula --ltl=/tmp/4436/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 387 places, 1134 transitions and 5328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4436/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4436/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4436/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4436/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 388 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 388, there are 1185 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 84
pnml2lts-mc( 0/ 4): unique states count: 84
pnml2lts-mc( 0/ 4): unique transitions count: 168
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 115
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 286 transitions, fanout: 2.466
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11600, Transitions per second: 28600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.1 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1164 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-06, 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 r492-smll-171636266300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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