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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 17:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 17:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 613K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716987079195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 12:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:51:20] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-29 12:51:20] [INFO ] Transformed 220 places.
[2024-05-29 12:51:20] [INFO ] Transformed 1212 transitions.
[2024-05-29 12:51:20] [INFO ] Found NUPN structural information;
[2024-05-29 12:51:20] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 412/412 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 179 transition count 366
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 179 transition count 366
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 179 transition count 360
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 105 place count 162 transition count 340
Iterating global reduction 1 with 17 rules applied. Total rules applied 122 place count 162 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 162 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 158 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 158 transition count 333
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 156 transition count 331
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 156 transition count 331
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 154 transition count 329
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 154 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 153 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 153 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 153 transition count 327
Applied a total of 144 rules in 66 ms. Remains 153 /220 variables (removed 67) and now considering 327/412 (removed 85) transitions.
[2024-05-29 12:51:20] [INFO ] Flow matrix only has 317 transitions (discarded 10 similar events)
// Phase 1: matrix 317 rows 153 cols
[2024-05-29 12:51:20] [INFO ] Computed 4 invariants in 16 ms
[2024-05-29 12:51:21] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-29 12:51:21] [INFO ] Flow matrix only has 317 transitions (discarded 10 similar events)
[2024-05-29 12:51:21] [INFO ] Invariant cache hit.
[2024-05-29 12:51:21] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-29 12:51:21] [INFO ] Implicit Places using invariants and state equation in 339 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 606 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/220 places, 327/412 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 315
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 140 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 134 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 134 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 131 transition count 301
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 131 transition count 301
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 128 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 128 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 125 transition count 295
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 125 transition count 295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 123 transition count 293
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 123 transition count 293
Applied a total of 63 rules in 15 ms. Remains 123 /152 variables (removed 29) and now considering 293/327 (removed 34) transitions.
[2024-05-29 12:51:21] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
// Phase 1: matrix 283 rows 123 cols
[2024-05-29 12:51:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 12:51:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 12:51:21] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
[2024-05-29 12:51:21] [INFO ] Invariant cache hit.
[2024-05-29 12:51:21] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:51:21] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/220 places, 293/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 892 ms. Remains : 123/220 places, 293/412 transitions.
Support contains 36 out of 123 places after structural reductions.
[2024-05-29 12:51:21] [INFO ] Flatten gal took : 85 ms
[2024-05-29 12:51:21] [INFO ] Flatten gal took : 50 ms
[2024-05-29 12:51:22] [INFO ] Input system was already deterministic with 293 transitions.
Support contains 34 out of 123 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (35 resets) in 2983 ms. (13 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (9 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2024-05-29 12:51:23] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
[2024-05-29 12:51:23] [INFO ] Invariant cache hit.
[2024-05-29 12:51:23] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/405 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 130/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 131/131 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 24/406 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/123 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 15 stabilizing places and 15 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' '!(F(G(p0)))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 123 transition count 240
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 70 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 69 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 68 transition count 231
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 117 place count 68 transition count 223
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 133 place count 60 transition count 223
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 140 place count 53 transition count 213
Iterating global reduction 4 with 7 rules applied. Total rules applied 147 place count 53 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 151 place count 53 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 53 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 52 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 51 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 51 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 51 transition count 202
Performed 26 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 211 place count 25 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 240 place count 25 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 334 place count 25 transition count 40
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 346 place count 19 transition count 34
Applied a total of 346 rules in 53 ms. Remains 19 /123 variables (removed 104) and now considering 34/293 (removed 259) transitions.
[2024-05-29 12:51:23] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
// Phase 1: matrix 28 rows 19 cols
[2024-05-29 12:51:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:51:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 12:51:23] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
[2024-05-29 12:51:23] [INFO ] Invariant cache hit.
[2024-05-29 12:51:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-29 12:51:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 12:51:23] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-29 12:51:23] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
[2024-05-29 12:51:23] [INFO ] Invariant cache hit.
[2024-05-29 12:51:23] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 4 ms to minimize.
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 4 ms to minimize.
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:51:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 4 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 27/46 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 12:51:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1/47 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 66 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 27/46 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 33/98 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 99 constraints, problems are : Problem set: 0 solved, 33 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 32/32 constraints]
After SMT, in 2253ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/123 places, 34/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2379 ms. Remains : 19/123 places, 34/293 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-00 finished in 2601 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 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 275
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 273
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 95 transition count 260
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 95 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 95 transition count 257
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 87 transition count 249
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 87 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 87 transition count 247
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 82 transition count 242
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 82 transition count 242
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 80 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 80 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 80 transition count 239
Applied a total of 94 rules in 16 ms. Remains 80 /123 variables (removed 43) and now considering 239/293 (removed 54) transitions.
[2024-05-29 12:51:26] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
// Phase 1: matrix 231 rows 80 cols
[2024-05-29 12:51:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:51:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:51:26] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
[2024-05-29 12:51:26] [INFO ] Invariant cache hit.
[2024-05-29 12:51:26] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:51:26] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-29 12:51:26] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
[2024-05-29 12:51:26] [INFO ] Invariant cache hit.
[2024-05-29 12:51:26] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:51:27] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 8 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 230/310 variables, 80/143 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:51:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:51:34] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:51:34] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:51:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/311 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/311 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 279 constraints, problems are : Problem set: 0 solved, 238 unsolved in 15380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 230/310 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 238/516 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/311 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 519 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 68/68 constraints]
After SMT, in 45924ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 45928ms
Starting structural reductions in LTL mode, iteration 1 : 80/123 places, 239/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46089 ms. Remains : 80/123 places, 239/293 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 279 steps with 0 reset in 15 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-01 finished in 46284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 272
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 96 transition count 260
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 96 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 96 transition count 257
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 90 transition count 251
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 90 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 90 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 86 transition count 246
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 86 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 85 transition count 245
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 85 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 85 transition count 244
Applied a total of 83 rules in 13 ms. Remains 85 /123 variables (removed 38) and now considering 244/293 (removed 49) transitions.
[2024-05-29 12:52:12] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
// Phase 1: matrix 237 rows 85 cols
[2024-05-29 12:52:12] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 12:52:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 12:52:12] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-05-29 12:52:12] [INFO ] Invariant cache hit.
[2024-05-29 12:52:12] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:52:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-29 12:52:12] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-05-29 12:52:12] [INFO ] Invariant cache hit.
[2024-05-29 12:52:12] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:52:14] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:52:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:52:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/130 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:52:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:52:20] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:52:20] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:52:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 18334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:32] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:52:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:52:32] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:52:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 513 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 53/53 constraints]
After SMT, in 48845ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 48849ms
Starting structural reductions in LTL mode, iteration 1 : 85/123 places, 244/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49011 ms. Remains : 85/123 places, 244/293 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 12930 steps (13 resets) in 67 ms. (190 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 244/244 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-05-29 12:53:02] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-05-29 12:53:02] [INFO ] Invariant cache hit.
[2024-05-29 12:53:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 12:53:02] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-05-29 12:53:02] [INFO ] Invariant cache hit.
[2024-05-29 12:53:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:53:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-29 12:53:02] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-05-29 12:53:02] [INFO ] Invariant cache hit.
[2024-05-29 12:53:02] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:53:05] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:53:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/130 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:53:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-05-29 12:53:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:53:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:53:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 18315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 12:53:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 513 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 53/53 constraints]
After SMT, in 48700ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 48703ms
Finished structural reductions in LTL mode , in 1 iterations and 48864 ms. Remains : 85/85 places, 244/244 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31140 steps (36 resets) in 186 ms. (166 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 244/244 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 85 transition count 244
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 23 place count 85 transition count 250
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 85 transition count 250
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 71 transition count 236
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 71 transition count 236
Performed 32 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 89 place count 71 transition count 244
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 170 place count 71 transition count 163
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 191 place count 50 transition count 142
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 212 place count 50 transition count 142
Deduced a syphon composed of 26 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 2 with 75 rules applied. Total rules applied 287 place count 50 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 293 place count 50 transition count 67
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 305 place count 38 transition count 55
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 317 place count 38 transition count 55
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 317 rules in 42 ms. Remains 38 /85 variables (removed 47) and now considering 55/244 (removed 189) transitions.
[2024-05-29 12:53:52] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 12:53:52] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 38 cols
[2024-05-29 12:53:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:53:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 7 (OVERLAPS) 48/86 variables, 38/71 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 8/79 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/79 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/87 variables, 1/80 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/80 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/87 variables, 0/80 constraints. Problems are: Problem set: 28 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 80 constraints, problems are : Problem set: 28 solved, 26 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 28 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 21/38 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 32/33 constraints. Problems are: Problem set: 28 solved, 26 unsolved
[2024-05-29 12:53:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:53:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/35 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 48/86 variables, 38/73 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 8/81 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 26/107 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/107 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/87 variables, 1/108 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/108 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/87 variables, 0/108 constraints. Problems are: Problem set: 28 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 108 constraints, problems are : Problem set: 28 solved, 26 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 26/54 constraints, Known Traps: 34/34 constraints]
After SMT, in 2621ms problems are : Problem set: 28 solved, 26 unsolved
Search for dead transitions found 28 dead transitions in 2622ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 38/85 places, 27/244 transitions.
Graph (complete) has 113 edges and 38 vertex of which 18 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 18 /38 variables (removed 20) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/85 places, 27/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2681 ms. Remains : 18/85 places, 27/244 transitions.
Built C files in :
/tmp/ltsmin513451750773852348
[2024-05-29 12:53:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin513451750773852348
Running compilation step : cd /tmp/ltsmin513451750773852348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 607 ms.
Running link step : cd /tmp/ltsmin513451750773852348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin513451750773852348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7434622537116323219.hoa' '--buchi-type=spotba'
LTSmin run took 1662 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-03 finished in 104971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 275
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 273
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 95 transition count 261
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 95 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 95 transition count 258
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 88 transition count 251
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 88 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 88 transition count 249
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 83 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 83 transition count 244
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 81 transition count 242
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 81 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 81 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 80 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 80 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 80 transition count 239
Applied a total of 95 rules in 19 ms. Remains 80 /123 variables (removed 43) and now considering 239/293 (removed 54) transitions.
[2024-05-29 12:53:57] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 80 cols
[2024-05-29 12:53:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 12:53:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:53:57] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-29 12:53:57] [INFO ] Invariant cache hit.
[2024-05-29 12:53:57] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:53:57] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-29 12:53:57] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-29 12:53:57] [INFO ] Invariant cache hit.
[2024-05-29 12:53:57] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:53:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:53:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:53:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:53:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:53:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:54:00] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:54:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:54:02] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 229/309 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:54:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/310 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 270 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16758 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:15] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:54:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:54:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:54:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:17] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:54:17] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 229/309 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 238/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 515 constraints, problems are : Problem set: 0 solved, 238 unsolved in 28276 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 64/64 constraints]
After SMT, in 45400ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 45403ms
Starting structural reductions in LTL mode, iteration 1 : 80/123 places, 239/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45565 ms. Remains : 80/123 places, 239/293 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-04
Product exploration explored 100000 steps with 20000 reset in 129 ms.
Product exploration explored 100000 steps with 20000 reset in 123 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 687 steps (0 resets) in 9 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 239/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-29 12:54:44] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-29 12:54:44] [INFO ] Invariant cache hit.
[2024-05-29 12:54:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 12:54:44] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-29 12:54:44] [INFO ] Invariant cache hit.
[2024-05-29 12:54:44] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:54:44] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-29 12:54:44] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-05-29 12:54:44] [INFO ] Invariant cache hit.
[2024-05-29 12:54:44] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:54:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:54:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:54:47] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:54:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:54:49] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:54:49] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:54:49] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 12:54:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 229/309 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:54:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:54:52] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/310 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 270 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:55:01] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:55:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:55:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:55:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:55:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-29 12:55:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:55:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 229/309 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 238/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 515 constraints, problems are : Problem set: 0 solved, 238 unsolved in 28299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 64/64 constraints]
After SMT, in 45042ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 45044ms
Finished structural reductions in LTL mode , in 1 iterations and 45176 ms. Remains : 80/80 places, 239/239 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 8 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 153 ms.
Product exploration explored 100000 steps with 20000 reset in 167 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 239/239 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 80 transition count 239
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 20 place count 80 transition count 245
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 80 transition count 245
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 38 place count 68 transition count 233
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 68 transition count 233
Performed 30 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 80 place count 68 transition count 238
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 128 place count 68 transition count 190
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 149 place count 47 transition count 169
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 170 place count 47 transition count 169
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 272 place count 47 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 278 place count 47 transition count 67
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 289 place count 36 transition count 56
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 300 place count 36 transition count 56
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 300 rules in 28 ms. Remains 36 /80 variables (removed 44) and now considering 56/239 (removed 183) transitions.
[2024-05-29 12:55:30] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-29 12:55:30] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
// Phase 1: matrix 48 rows 36 cols
[2024-05-29 12:55:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 12:55:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 20/22 constraints. Problems are: Problem set: 4 solved, 51 unsolved
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/30 constraints. Problems are: Problem set: 4 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 51 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 5 (OVERLAPS) 47/83 variables, 36/66 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 9/75 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/75 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/84 variables, 1/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 76 constraints, problems are : Problem set: 24 solved, 31 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 24 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 19/36 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 28/30 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-05-29 12:55:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:55:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:55:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/33 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-05-29 12:55:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/34 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-05-29 12:55:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/35 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 47/83 variables, 36/71 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 9/80 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 31/111 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/111 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 112 constraints, problems are : Problem set: 24 solved, 31 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 31/55 constraints, Known Traps: 33/33 constraints]
After SMT, in 2393ms problems are : Problem set: 24 solved, 31 unsolved
Search for dead transitions found 24 dead transitions in 2394ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 36/80 places, 32/239 transitions.
Graph (complete) has 116 edges and 36 vertex of which 18 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 18 /36 variables (removed 18) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/80 places, 32/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2431 ms. Remains : 18/80 places, 32/239 transitions.
Built C files in :
/tmp/ltsmin18375523252043308031
[2024-05-29 12:55:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18375523252043308031
Running compilation step : cd /tmp/ltsmin18375523252043308031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 475 ms.
Running link step : cd /tmp/ltsmin18375523252043308031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18375523252043308031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16792398949628695279.hoa' '--buchi-type=spotba'
LTSmin run took 342 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-04 finished in 96720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(G(!p1))) U G((!p2 U p3)))))'
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 108 transition count 275
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 108 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 108 transition count 273
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 263
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 99 transition count 262
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 93 transition count 256
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 93 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 93 transition count 255
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 90 transition count 252
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 90 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 89 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 89 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 88 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 88 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 88 transition count 249
Applied a total of 75 rules in 17 ms. Remains 88 /123 variables (removed 35) and now considering 249/293 (removed 44) transitions.
[2024-05-29 12:55:34] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
// Phase 1: matrix 242 rows 88 cols
[2024-05-29 12:55:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:55:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 12:55:34] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-05-29 12:55:34] [INFO ] Invariant cache hit.
[2024-05-29 12:55:34] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:55:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-29 12:55:34] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-05-29 12:55:34] [INFO ] Invariant cache hit.
[2024-05-29 12:55:34] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:55:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:55:36] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:55:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:55:39] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:55:39] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 241/329 variables, 88/136 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 130/266 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/330 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 267 constraints, problems are : Problem set: 0 solved, 248 unsolved in 17364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:53] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 12:55:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 241/329 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 248/517 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/330 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 518 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 50/50 constraints]
After SMT, in 47732ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 47734ms
Starting structural reductions in LTL mode, iteration 1 : 88/123 places, 249/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47867 ms. Remains : 88/123 places, 249/293 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p3), (NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 254 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 174 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (53 resets) in 1196 ms. (33 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2024-05-29 12:56:23] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-05-29 12:56:23] [INFO ] Invariant cache hit.
[2024-05-29 12:56:23] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 241/329 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 130/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/330 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 220 constraints, problems are : Problem set: 0 solved, 4 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 12:56:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:56:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
Problem apf3 is UNSAT
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:56:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:56:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:56:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:56:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 88/330 variables, and 32 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 1433ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (G (OR (NOT p0) p3 p2)), (G (OR p0 p3 p2)), (G (OR p0 p3 (NOT p2))), (G (OR p3 p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (AND p0 p3) (AND p0 (NOT p2))))), (F (NOT (OR p3 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (OR p0 (NOT p3)) (OR p0 p2)))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 26 factoid took 489 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), true, p1, (NOT p3)]
Support contains 7 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 249/249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 88 transition count 228
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 67 transition count 228
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 67 transition count 222
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 61 transition count 222
Performed 28 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 110 place count 33 transition count 182
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 129 place count 33 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 231 place count 33 transition count 61
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 243 place count 27 transition count 55
Applied a total of 243 rules in 30 ms. Remains 27 /88 variables (removed 61) and now considering 55/249 (removed 194) transitions.
[2024-05-29 12:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 27 cols
[2024-05-29 12:56:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:56:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 12:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-29 12:56:25] [INFO ] Invariant cache hit.
[2024-05-29 12:56:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-29 12:56:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-29 12:56:25] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 12:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-29 12:56:25] [INFO ] Invariant cache hit.
[2024-05-29 12:56:26] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 3 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:56:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:56:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 12:56:27] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 48/75 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 1/76 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/76 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 92 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 48/75 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 54/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 146 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 37/37 constraints]
After SMT, in 3896ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/88 places, 55/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3991 ms. Remains : 27/88 places, 55/249 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 14 factoid took 198 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p3), true, p1, (NOT p3)]
RANDOM walk for 40000 steps (1680 resets) in 107 ms. (370 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (365 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-29 12:56:30] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-29 12:56:30] [INFO ] Invariant cache hit.
[2024-05-29 12:56:30] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/76 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Int declared 27/76 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/27 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 265ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (G (OR p0 p3))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p3))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p3))), (F (NOT (OR p0 (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 400 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p3), true, p1, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Built C files in :
/tmp/ltsmin9437837922989826707
[2024-05-29 12:56:31] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-29 12:56:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:31] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-29 12:56:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:31] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-29 12:56:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9437837922989826707
Running compilation step : cd /tmp/ltsmin9437837922989826707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin9437837922989826707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9437837922989826707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11826327238949311534.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-09 finished in 57672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 123 transition count 243
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 105 place count 73 transition count 238
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 72 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 70 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 111 place count 70 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 127 place count 62 transition count 227
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 133 place count 56 transition count 218
Iterating global reduction 4 with 6 rules applied. Total rules applied 139 place count 56 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 146 place count 56 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 146 place count 56 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 55 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 54 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 54 transition count 208
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 158 place count 54 transition count 200
Performed 27 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 212 place count 27 transition count 161
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 6 with 54 rules applied. Total rules applied 266 place count 27 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 7 with 68 rules applied. Total rules applied 334 place count 27 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 346 place count 21 transition count 33
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 349 place count 21 transition count 33
Applied a total of 349 rules in 19 ms. Remains 21 /123 variables (removed 102) and now considering 33/293 (removed 260) transitions.
[2024-05-29 12:56:31] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 21 cols
[2024-05-29 12:56:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:56:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 12:56:31] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:31] [INFO ] Invariant cache hit.
[2024-05-29 12:56:31] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 12:56:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-29 12:56:31] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-29 12:56:31] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:31] [INFO ] Invariant cache hit.
[2024-05-29 12:56:31] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 25/46 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 25/46 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 32/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 101 constraints, problems are : Problem set: 0 solved, 32 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 36/36 constraints]
After SMT, in 2107ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/123 places, 33/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2178 ms. Remains : 21/123 places, 33/293 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5302 resets) in 61 ms. (645 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1260 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-29 12:56:34] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:34] [INFO ] Invariant cache hit.
[2024-05-29 12:56:34] [INFO ] State equation strengthened by 11 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) 17/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/47 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 33 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 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) 17/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 21/47 variables, and 21 constraints, problems are : Problem set: 1 solved, 0 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/21 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 483ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 343 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-29 12:56:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:35] [INFO ] Invariant cache hit.
[2024-05-29 12:56:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 12:56:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:35] [INFO ] Invariant cache hit.
[2024-05-29 12:56:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 12:56:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-29 12:56:35] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-29 12:56:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-05-29 12:56:35] [INFO ] Invariant cache hit.
[2024-05-29 12:56:35] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 7 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 25/46 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 25/46 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 32/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 101 constraints, problems are : Problem set: 0 solved, 32 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 36/36 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2203 ms. Remains : 21/21 places, 33/33 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 122 steps (14 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Built C files in :
/tmp/ltsmin12444016315206532112
[2024-05-29 12:56:38] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-29 12:56:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:38] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-29 12:56:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:38] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-29 12:56:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:56:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12444016315206532112
Running compilation step : cd /tmp/ltsmin12444016315206532112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin12444016315206532112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12444016315206532112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4374143805990185284.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-12 finished in 6585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 122 transition count 239
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 69 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 68 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 67 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 117 place count 67 transition count 222
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 133 place count 59 transition count 222
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 138 place count 54 transition count 215
Iterating global reduction 4 with 5 rules applied. Total rules applied 143 place count 54 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 54 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 146 place count 54 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 53 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 52 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 52 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 154 place count 52 transition count 205
Performed 22 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 198 place count 30 transition count 174
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 229 place count 30 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 233 place count 28 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 235 place count 28 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 8 with 87 rules applied. Total rules applied 322 place count 28 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 334 place count 22 transition count 46
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 338 place count 18 transition count 42
Applied a total of 338 rules in 25 ms. Remains 18 /123 variables (removed 105) and now considering 42/293 (removed 251) transitions.
[2024-05-29 12:56:38] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 18 cols
[2024-05-29 12:56:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:56:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 12:56:38] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-05-29 12:56:38] [INFO ] Invariant cache hit.
[2024-05-29 12:56:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:56:38] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-29 12:56:38] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 12:56:38] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-05-29 12:56:38] [INFO ] Invariant cache hit.
[2024-05-29 12:56:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 35/53 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/54 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/54 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 50 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 35/53 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 71 constraints, problems are : Problem set: 0 solved, 19 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 32/32 constraints]
After SMT, in 1368ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/123 places, 42/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1447 ms. Remains : 18/123 places, 42/293 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-13 finished in 1545 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 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 122 transition count 242
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 106 place count 72 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 71 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 69 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 69 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 61 transition count 225
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 55 transition count 216
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 55 transition count 216
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 55 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 147 place count 55 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 54 transition count 208
Performed 23 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 195 place count 31 transition count 174
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 225 place count 31 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 29 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 231 place count 29 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 325 place count 29 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 337 place count 23 transition count 40
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 341 place count 19 transition count 36
Applied a total of 341 rules in 20 ms. Remains 19 /123 variables (removed 104) and now considering 36/293 (removed 257) transitions.
[2024-05-29 12:56:39] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
// Phase 1: matrix 30 rows 19 cols
[2024-05-29 12:56:39] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:56:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:56:40] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-29 12:56:40] [INFO ] Invariant cache hit.
[2024-05-29 12:56:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:56:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-29 12:56:40] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 12:56:40] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-29 12:56:40] [INFO ] Invariant cache hit.
[2024-05-29 12:56:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 29/48 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 53 constraints, problems are : Problem set: 0 solved, 19 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:56:41] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 29/48 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 73 constraints, problems are : Problem set: 0 solved, 19 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 33/33 constraints]
After SMT, in 1272ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1273ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/123 places, 36/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1354 ms. Remains : 19/123 places, 36/293 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-15 finished in 1460 ms.
All properties solved by simple procedures.
Total runtime 321154 ms.

BK_STOP 1716987401466

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-05a, 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 r400-tall-171690531700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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