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

--------------------
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-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717230158222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:22:39] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 08:22:39] [INFO ] Transformed 220 places.
[2024-06-01 08:22:39] [INFO ] Transformed 1212 transitions.
[2024-06-01 08:22:39] [INFO ] Found NUPN structural information;
[2024-06-01 08:22:39] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
Support contains 16 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 412/412 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 174 transition count 360
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 174 transition count 360
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 174 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 120 place count 151 transition count 326
Iterating global reduction 1 with 23 rules applied. Total rules applied 143 place count 151 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 148 place count 151 transition count 321
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 147 transition count 317
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 147 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 160 place count 143 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 143 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 139 transition count 309
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 139 transition count 309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 176 place count 135 transition count 305
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 135 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 184 place count 135 transition count 301
Applied a total of 184 rules in 73 ms. Remains 135 /220 variables (removed 85) and now considering 301/412 (removed 111) transitions.
[2024-06-01 08:22:39] [INFO ] Flow matrix only has 294 transitions (discarded 7 similar events)
// Phase 1: matrix 294 rows 135 cols
[2024-06-01 08:22:39] [INFO ] Computed 2 invariants in 23 ms
[2024-06-01 08:22:40] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 08:22:40] [INFO ] Flow matrix only has 294 transitions (discarded 7 similar events)
[2024-06-01 08:22:40] [INFO ] Invariant cache hit.
[2024-06-01 08:22:40] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-06-01 08:22:40] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 08:22:40] [INFO ] Flow matrix only has 294 transitions (discarded 7 similar events)
[2024-06-01 08:22:40] [INFO ] Invariant cache hit.
[2024-06-01 08:22:40] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:42] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 12 ms to minimize.
[2024-06-01 08:22:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:22:44] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:22:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:22:45] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:22:45] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:22:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:22:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:22:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:22:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:22:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 293/428 variables, 135/215 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 184/399 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:22:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:23:01] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 14 (OVERLAPS) 1/429 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 429/429 variables, and 404 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:23:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:23:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 08:23:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:23:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 293/428 variables, 135/228 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 184/412 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 300/712 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 1/429 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 713 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 91/91 constraints]
After SMT, in 60651ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Starting structural reductions in LTL mode, iteration 1 : 135/220 places, 301/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61218 ms. Remains : 135/220 places, 301/412 transitions.
Support contains 16 out of 135 places after structural reductions.
[2024-06-01 08:23:41] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:23:41] [INFO ] Flatten gal took : 24 ms
[2024-06-01 08:23:41] [INFO ] Input system was already deterministic with 301 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (38 resets) in 1662 ms. (24 steps per ms) remains 0/12 properties
Computed a total of 38 stabilizing places and 37 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(p0)||G(p1)))'
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 133 transition count 231
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 88 rules applied. Total rules applied 158 place count 64 transition count 212
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 170 place count 58 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 170 place count 58 transition count 201
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 180 place count 53 transition count 201
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 192 place count 41 transition count 189
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 41 transition count 189
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 268 place count 41 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 268 place count 41 transition count 119
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 280 place count 35 transition count 119
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 294 place count 28 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 300 place count 28 transition count 105
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 4 with 12 rules applied. Total rules applied 312 place count 22 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 21 transition count 98
Applied a total of 313 rules in 61 ms. Remains 21 /135 variables (removed 114) and now considering 98/301 (removed 203) transitions.
[2024-06-01 08:23:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
// Phase 1: matrix 91 rows 21 cols
[2024-06-01 08:23:42] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:23:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:23:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
[2024-06-01 08:23:42] [INFO ] Invariant cache hit.
[2024-06-01 08:23:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 08:23:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 08:23:42] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-01 08:23:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
[2024-06-01 08:23:42] [INFO ] Invariant cache hit.
[2024-06-01 08:23:42] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [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, 14/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 90/111 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 75/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/112 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 123 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2497 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 90/111 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 75/125 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 92/217 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 218 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 28/28 constraints]
After SMT, in 6366ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/135 places, 98/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6515 ms. Remains : 21/135 places, 98/301 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-00 finished in 6833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 14 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:23:49] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:23:49] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:23:49] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 08:23:49] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:23:49] [INFO ] Invariant cache hit.
[2024-06-01 08:23:49] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:23:49] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 13 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-06-01 08:23:49] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-06-01 08:23:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:23:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 08:23:49] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:23:49] [INFO ] Invariant cache hit.
[2024-06-01 08:23:49] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:23:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/135 places, 233/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 76/135 places, 233/301 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 2500 reset in 258 ms.
Product exploration explored 100000 steps with 2500 reset in 181 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 156 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:23:50] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:23:50] [INFO ] Invariant cache hit.
[2024-06-01 08:23:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:23:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 08:23:50] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:23:50] [INFO ] [Real]Added 131 Read/Feed constraints in 18 ms returned sat
[2024-06-01 08:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:23:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:23:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 08:23:50] [INFO ] [Nat]Added 131 Read/Feed constraints in 11 ms returned sat
[2024-06-01 08:23:50] [INFO ] Computed and/alt/rep : 80/98/80 causal constraints (skipped 145 transitions) in 21 ms.
[2024-06-01 08:23:51] [INFO ] Added : 62 causal constraints over 14 iterations in 293 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 75 transition count 213
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 56 transition count 213
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 56 transition count 207
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 50 place count 50 transition count 207
Performed 19 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 88 place count 31 transition count 181
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 151 place count 31 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 26 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 26 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 172 place count 26 transition count 102
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 4 with 12 rules applied. Total rules applied 184 place count 20 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 19 transition count 95
Applied a total of 185 rules in 32 ms. Remains 19 /76 variables (removed 57) and now considering 95/233 (removed 138) transitions.
[2024-06-01 08:23:51] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:23:51] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:23:51] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:23:51] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:51] [INFO ] Invariant cache hit.
[2024-06-01 08:23:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:23:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 08:23:51] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:23:51] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:51] [INFO ] Invariant cache hit.
[2024-06-01 08:23:51] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:23:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:23:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:23:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 87/106 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 74/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 208 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
After SMT, in 5779ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/76 places, 95/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5873 ms. Remains : 19/76 places, 95/233 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:23:57] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:57] [INFO ] Invariant cache hit.
[2024-06-01 08:23:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:23:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:23:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:23:57] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:23:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:23:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:23:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:23:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 7 ms.
[2024-06-01 08:23:57] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 242 ms.
Product exploration explored 100000 steps with 14285 reset in 328 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:23:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:58] [INFO ] Invariant cache hit.
[2024-06-01 08:23:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 08:23:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:58] [INFO ] Invariant cache hit.
[2024-06-01 08:23:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:23:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 08:23:58] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:23:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:23:58] [INFO ] Invariant cache hit.
[2024-06-01 08:23:58] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 87/106 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 74/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 208 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
After SMT, in 5874ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5875ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5980 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-01 finished in 15309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 195 place count 39 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 208 place count 39 transition count 187
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 273 place count 39 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 39 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 33 transition count 116
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 299 place count 26 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 305 place count 26 transition count 102
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 4 with 12 rules applied. Total rules applied 317 place count 20 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 19 transition count 95
Applied a total of 318 rules in 24 ms. Remains 19 /135 variables (removed 116) and now considering 95/301 (removed 206) transitions.
[2024-06-01 08:24:04] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:24:04] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:24:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 08:24:04] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:04] [INFO ] Invariant cache hit.
[2024-06-01 08:24:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 08:24:04] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:24:04] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:04] [INFO ] Invariant cache hit.
[2024-06-01 08:24:04] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 4 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:24:05] [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, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:24:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:24:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7711ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7712ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/135 places, 95/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7848 ms. Remains : 19/135 places, 95/301 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-02
Product exploration explored 100000 steps with 14285 reset in 195 ms.
Product exploration explored 100000 steps with 14285 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 08:24:12] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:12] [INFO ] Invariant cache hit.
[2024-06-01 08:24:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:24:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:24:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:12] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:24:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:24:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 8 ms returned sat
[2024-06-01 08:24:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 8 ms.
[2024-06-01 08:24:13] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:24:13] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:13] [INFO ] Invariant cache hit.
[2024-06-01 08:24:13] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:24:13] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:13] [INFO ] Invariant cache hit.
[2024-06-01 08:24:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 08:24:13] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:24:13] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:13] [INFO ] Invariant cache hit.
[2024-06-01 08:24:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:24:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7511ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7583 ms. Remains : 19/19 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-06-01 08:24:20] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:20] [INFO ] Invariant cache hit.
[2024-06-01 08:24:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:24:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:24:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:21] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:24:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:24:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:24:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 8 ms returned sat
[2024-06-01 08:24:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 08:24:21] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 196 ms.
Product exploration explored 100000 steps with 14285 reset in 203 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:24:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:21] [INFO ] Invariant cache hit.
[2024-06-01 08:24:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:24:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:21] [INFO ] Invariant cache hit.
[2024-06-01 08:24:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 08:24:21] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:24:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:21] [INFO ] Invariant cache hit.
[2024-06-01 08:24:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:21] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:24:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:24:21] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:24:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:24:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:23] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:24:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:24:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:24:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:24:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7600ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7673 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-02 finished in 24935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 195 place count 39 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 208 place count 39 transition count 187
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 273 place count 39 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 39 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 33 transition count 116
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 299 place count 26 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 305 place count 26 transition count 102
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 4 with 12 rules applied. Total rules applied 317 place count 20 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 19 transition count 95
Applied a total of 318 rules in 22 ms. Remains 19 /135 variables (removed 116) and now considering 95/301 (removed 206) transitions.
[2024-06-01 08:24:29] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:29] [INFO ] Invariant cache hit.
[2024-06-01 08:24:29] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:24:29] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:29] [INFO ] Invariant cache hit.
[2024-06-01 08:24:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:24:29] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 08:24:29] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:24:29] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:24:29] [INFO ] Invariant cache hit.
[2024-06-01 08:24:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:24:29] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:24:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:24:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:24:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:24:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7370ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/135 places, 95/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7453 ms. Remains : 19/135 places, 95/301 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-03 finished in 7507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((!p0&&X(p0)) U (F(p2)&&p1)))))'
Support contains 9 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 131 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 130 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 129 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 129 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 128 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 128 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 128 transition count 291
Applied a total of 17 rules in 15 ms. Remains 128 /135 variables (removed 7) and now considering 291/301 (removed 10) transitions.
[2024-06-01 08:24:36] [INFO ] Flow matrix only has 284 transitions (discarded 7 similar events)
// Phase 1: matrix 284 rows 128 cols
[2024-06-01 08:24:36] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:24:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 08:24:36] [INFO ] Flow matrix only has 284 transitions (discarded 7 similar events)
[2024-06-01 08:24:36] [INFO ] Invariant cache hit.
[2024-06-01 08:24:36] [INFO ] State equation strengthened by 182 read => feed constraints.
[2024-06-01 08:24:36] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-01 08:24:36] [INFO ] Flow matrix only has 284 transitions (discarded 7 similar events)
[2024-06-01 08:24:37] [INFO ] Invariant cache hit.
[2024-06-01 08:24:37] [INFO ] State equation strengthened by 182 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:24:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:24:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:24:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:24:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:24:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 283/411 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 181/381 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:24:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 14 (OVERLAPS) 1/412 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/412 variables, and 386 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:08] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:25:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:25:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:11] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:25:15] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:25:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:25:17] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 11 (OVERLAPS) 283/411 variables, 128/216 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 181/397 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 290/687 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 290 unsolved
SMT process timed out in 60470ms, After SMT, problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 128/135 places, 291/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 128/135 places, 291/301 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-04 finished in 60954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 10 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:25:37] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:25:37] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 08:25:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 08:25:37] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:25:37] [INFO ] Invariant cache hit.
[2024-06-01 08:25:37] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:25:38] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 272 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 10 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-06-01 08:25:38] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-06-01 08:25:38] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:25:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:25:38] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:25:38] [INFO ] Invariant cache hit.
[2024-06-01 08:25:38] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:25:38] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/135 places, 233/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 76/135 places, 233/301 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-05
Product exploration explored 100000 steps with 2500 reset in 153 ms.
Product exploration explored 100000 steps with 2500 reset in 136 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 156 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:25:38] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:25:38] [INFO ] Invariant cache hit.
[2024-06-01 08:25:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:25:39] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 08:25:39] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:25:39] [INFO ] [Real]Added 131 Read/Feed constraints in 11 ms returned sat
[2024-06-01 08:25:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:25:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:25:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 08:25:39] [INFO ] [Nat]Added 131 Read/Feed constraints in 13 ms returned sat
[2024-06-01 08:25:39] [INFO ] Computed and/alt/rep : 80/98/80 causal constraints (skipped 145 transitions) in 15 ms.
[2024-06-01 08:25:39] [INFO ] Added : 62 causal constraints over 14 iterations in 211 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 75 transition count 213
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 56 transition count 213
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 56 transition count 207
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 50 place count 50 transition count 207
Performed 19 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 88 place count 31 transition count 181
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 151 place count 31 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 26 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 26 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 172 place count 26 transition count 102
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 4 with 12 rules applied. Total rules applied 184 place count 20 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 19 transition count 95
Applied a total of 185 rules in 36 ms. Remains 19 /76 variables (removed 57) and now considering 95/233 (removed 138) transitions.
[2024-06-01 08:25:39] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:25:39] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:25:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:25:39] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:39] [INFO ] Invariant cache hit.
[2024-06-01 08:25:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:25:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 08:25:39] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:25:39] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:39] [INFO ] Invariant cache hit.
[2024-06-01 08:25:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:25:40] [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, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:25:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:25:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:25:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 87/106 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 74/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 208 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
After SMT, in 5788ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/76 places, 95/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5918 ms. Remains : 19/76 places, 95/233 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:25:45] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:45] [INFO ] Invariant cache hit.
[2024-06-01 08:25:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:25:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 08:25:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:25:45] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:25:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:25:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 08:25:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:25:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 08:25:45] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 211 ms.
Product exploration explored 100000 steps with 14285 reset in 214 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:25:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:46] [INFO ] Invariant cache hit.
[2024-06-01 08:25:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:25:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:46] [INFO ] Invariant cache hit.
[2024-06-01 08:25:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:25:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 08:25:46] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:25:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:25:46] [INFO ] Invariant cache hit.
[2024-06-01 08:25:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 87/106 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 74/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 208 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3527 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
After SMT, in 5686ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5758 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-05 finished in 14439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 135 transition count 294
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 128 transition count 290
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 18 place count 128 transition count 264
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 70 place count 102 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 99 transition count 261
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 99 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 99 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 98 transition count 259
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 98 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 97 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 97 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 97 transition count 257
Performed 25 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 132 place count 72 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 138 place count 72 transition count 223
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 151 place count 59 transition count 210
Iterating global reduction 5 with 13 rules applied. Total rules applied 164 place count 59 transition count 210
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 227 place count 59 transition count 147
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 233 place count 53 transition count 141
Iterating global reduction 6 with 6 rules applied. Total rules applied 239 place count 53 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 240 place count 53 transition count 140
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 245 place count 48 transition count 135
Iterating global reduction 7 with 5 rules applied. Total rules applied 250 place count 48 transition count 135
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 262 place count 42 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 268 place count 42 transition count 123
Applied a total of 268 rules in 29 ms. Remains 42 /135 variables (removed 93) and now considering 123/301 (removed 178) transitions.
[2024-06-01 08:25:52] [INFO ] Flow matrix only has 116 transitions (discarded 7 similar events)
// Phase 1: matrix 116 rows 42 cols
[2024-06-01 08:25:52] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 08:25:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 08:25:52] [INFO ] Flow matrix only has 116 transitions (discarded 7 similar events)
[2024-06-01 08:25:52] [INFO ] Invariant cache hit.
[2024-06-01 08:25:52] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-01 08:25:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 08:25:52] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 08:25:52] [INFO ] Flow matrix only has 116 transitions (discarded 7 similar events)
[2024-06-01 08:25:52] [INFO ] Invariant cache hit.
[2024-06-01 08:25:52] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 08:25:54] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:25:54] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:25:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:25:54] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 115/157 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 190 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 08:25:56] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:25:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 115/157 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 106/196 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 122/318 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/158 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 319 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 46/46 constraints]
After SMT, in 11183ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/135 places, 123/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11360 ms. Remains : 42/135 places, 123/301 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-06
Stuttering criterion allowed to conclude after 1436 steps with 112 reset in 15 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-06 finished in 11474 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 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 131 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 130 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 129 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 129 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 128 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 127 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 127 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 127 transition count 290
Applied a total of 19 rules in 11 ms. Remains 127 /135 variables (removed 8) and now considering 290/301 (removed 11) transitions.
[2024-06-01 08:26:03] [INFO ] Flow matrix only has 283 transitions (discarded 7 similar events)
// Phase 1: matrix 283 rows 127 cols
[2024-06-01 08:26:03] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:26:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 08:26:03] [INFO ] Flow matrix only has 283 transitions (discarded 7 similar events)
[2024-06-01 08:26:03] [INFO ] Invariant cache hit.
[2024-06-01 08:26:03] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-06-01 08:26:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [126]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/135 places, 290/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 109 transition count 273
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 109 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 109 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 103 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 103 transition count 261
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 97 transition count 255
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 97 transition count 255
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 91 transition count 249
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 91 transition count 249
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 85 transition count 243
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 85 transition count 243
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 80 transition count 238
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 80 transition count 238
Applied a total of 98 rules in 9 ms. Remains 80 /126 variables (removed 46) and now considering 238/290 (removed 52) transitions.
[2024-06-01 08:26:03] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
// Phase 1: matrix 231 rows 80 cols
[2024-06-01 08:26:03] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:26:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 08:26:04] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:04] [INFO ] Invariant cache hit.
[2024-06-01 08:26:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:26:04] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 80/135 places, 238/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 478 ms. Remains : 80/135 places, 238/301 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 135 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 90 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 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 25712 steps (27 resets) in 276 ms. (92 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 67 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 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 238/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-06-01 08:26:05] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 08:26:05] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:26:05] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-01 08:26:05] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [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, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:26:06] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:26:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 230/310 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 1/311 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 0/311 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 261 constraints, problems are : Problem set: 0 solved, 237 unsolved in 16761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 230/310 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 237/497 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 498 constraints, problems are : Problem set: 0 solved, 237 unsolved in 25409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 49/49 constraints]
After SMT, in 42535ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 42537ms
Finished structural reductions in LTL mode , in 1 iterations and 42674 ms. Remains : 80/80 places, 238/238 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 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 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32872 steps (38 resets) in 183 ms. (178 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 90 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 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 238/238 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 80 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 21 place count 80 transition count 244
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 80 transition count 244
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 67 transition count 231
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 67 transition count 231
Performed 31 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 84 place count 67 transition count 238
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 165 place count 67 transition count 157
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 185 place count 47 transition count 137
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 205 place count 47 transition count 137
Deduced a syphon composed of 25 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 280 place count 47 transition count 62
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 286 place count 47 transition count 62
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 298 place count 35 transition count 50
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 310 place count 35 transition count 50
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 310 rules in 14 ms. Remains 35 /80 variables (removed 45) and now considering 50/238 (removed 188) transitions.
[2024-06-01 08:26:49] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 08:26:49] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 35 cols
[2024-06-01 08:26:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:26:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 49 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 TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/78 variables, 35/64 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 7/71 constraints. Problems are: Problem set: 26 solved, 23 unsolved
[2024-06-01 08:26:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/72 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/72 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/73 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/73 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/73 constraints. Problems are: Problem set: 26 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 73 constraints, problems are : Problem set: 26 solved, 23 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 26 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 20/35 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 29/30 constraints. Problems are: Problem set: 26 solved, 23 unsolved
[2024-06-01 08:26:50] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:26:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/33 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/33 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 43/78 variables, 35/68 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/75 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 23/98 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 26 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 26 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 26 solved, 23 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/49 constraints, Known Traps: 32/32 constraints]
After SMT, in 2222ms problems are : Problem set: 26 solved, 23 unsolved
Search for dead transitions found 26 dead transitions in 2222ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 35/80 places, 24/238 transitions.
Graph (complete) has 105 edges and 35 vertex of which 16 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 16 /35 variables (removed 19) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/80 places, 24/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2246 ms. Remains : 16/80 places, 24/238 transitions.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 238/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-06-01 08:26:51] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
// Phase 1: matrix 231 rows 80 cols
[2024-06-01 08:26:51] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:26:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 08:26:51] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:51] [INFO ] Invariant cache hit.
[2024-06-01 08:26:51] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:26:51] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-01 08:26:51] [INFO ] Flow matrix only has 231 transitions (discarded 7 similar events)
[2024-06-01 08:26:51] [INFO ] Invariant cache hit.
[2024-06-01 08:26:51] [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, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:26:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 230/310 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 1/311 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 0/311 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 261 constraints, problems are : Problem set: 0 solved, 237 unsolved in 17389 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 230/310 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 237/497 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 498 constraints, problems are : Problem set: 0 solved, 237 unsolved in 26097 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 49/49 constraints]
After SMT, in 43868ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 43870ms
Finished structural reductions in LTL mode , in 1 iterations and 44009 ms. Remains : 80/80 places, 238/238 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-07 finished in 91649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 135 transition count 296
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 130 transition count 292
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 14 place count 130 transition count 265
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 68 place count 103 transition count 265
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 99 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 99 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 99 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 98 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 98 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 97 transition count 257
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 97 transition count 257
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 97 transition count 256
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 119 place count 79 transition count 237
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 127 place count 71 transition count 229
Iterating global reduction 4 with 8 rules applied. Total rules applied 135 place count 71 transition count 229
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 198 place count 71 transition count 166
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 200 place count 69 transition count 164
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 69 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 69 transition count 163
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 204 place count 68 transition count 162
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 68 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 211 place count 68 transition count 156
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 6 with 12 rules applied. Total rules applied 223 place count 62 transition count 150
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 227 place count 62 transition count 150
Applied a total of 227 rules in 36 ms. Remains 62 /135 variables (removed 73) and now considering 150/301 (removed 151) transitions.
[2024-06-01 08:27:35] [INFO ] Flow matrix only has 143 transitions (discarded 7 similar events)
// Phase 1: matrix 143 rows 62 cols
[2024-06-01 08:27:35] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:27:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:27:35] [INFO ] Flow matrix only has 143 transitions (discarded 7 similar events)
[2024-06-01 08:27:35] [INFO ] Invariant cache hit.
[2024-06-01 08:27:35] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-06-01 08:27:35] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 08:27:35] [INFO ] Redundant transitions in 1 ms returned []
Running 149 sub problems to find dead transitions.
[2024-06-01 08:27:35] [INFO ] Flow matrix only has 143 transitions (discarded 7 similar events)
[2024-06-01 08:27:35] [INFO ] Invariant cache hit.
[2024-06-01 08:27:35] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:36] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:27:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:27:39] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:27:39] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 142/204 variables, 62/109 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 127/236 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 14 (OVERLAPS) 1/205 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 237 constraints, problems are : Problem set: 0 solved, 149 unsolved in 8513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 08:27:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 142/204 variables, 62/114 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 127/241 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 149/390 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 1/205 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 391 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 50/50 constraints]
After SMT, in 18198ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 18199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/135 places, 150/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18389 ms. Remains : 62/135 places, 150/301 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-08
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-08 finished in 18578 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(G((p0&&F(p1)&&F((G(F(!p2))||(!p3&&F(!p2))))))))))'
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 11 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:27:53] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:27:53] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:27:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 08:27:53] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:27:53] [INFO ] Invariant cache hit.
[2024-06-01 08:27:54] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:27:54] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-01 08:27:54] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:27:54] [INFO ] Invariant cache hit.
[2024-06-01 08:27:54] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 277/400 variables, 123/211 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 178/389 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:28:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:28:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 15 (OVERLAPS) 1/401 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 394 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:30] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-01 08:28:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 277/400 variables, 123/221 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 178/399 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 284/683 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 12 (OVERLAPS) 1/401 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 684 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 96/96 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 285/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 123/135 places, 285/301 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, (NOT p1), p2]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-09
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-09 finished in 60881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0)))) U p1))'
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 9 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:28:54] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:28:54] [INFO ] Invariant cache hit.
[2024-06-01 08:28:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:28:54] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:28:54] [INFO ] Invariant cache hit.
[2024-06-01 08:28:54] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 82 transition count 239
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 82 transition count 239
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 77 transition count 234
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 77 transition count 234
Applied a total of 96 rules in 5 ms. Remains 77 /122 variables (removed 45) and now considering 234/285 (removed 51) transitions.
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
// Phase 1: matrix 227 rows 77 cols
[2024-06-01 08:28:55] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
[2024-06-01 08:28:55] [INFO ] Invariant cache hit.
[2024-06-01 08:28:55] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 77/135 places, 234/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 77/135 places, 234/301 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-10 finished in 544 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(p1))&&p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 10 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:28:55] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:28:55] [INFO ] Invariant cache hit.
[2024-06-01 08:28:55] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 4 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-06-01 08:28:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:28:55] [INFO ] Invariant cache hit.
[2024-06-01 08:28:55] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/135 places, 233/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 424 ms. Remains : 76/135 places, 233/301 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-11 finished in 531 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)&&X(X(X(p1))))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 8 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:28:55] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 08:28:55] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:28:55] [INFO ] Invariant cache hit.
[2024-06-01 08:28:55] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 292 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 7 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-06-01 08:28:56] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-06-01 08:28:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:28:56] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:28:56] [INFO ] Invariant cache hit.
[2024-06-01 08:28:56] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/135 places, 233/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 412 ms. Remains : 76/135 places, 233/301 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-12 finished in 634 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 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 195 place count 39 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 208 place count 39 transition count 187
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 273 place count 39 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 39 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 33 transition count 116
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 299 place count 26 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 305 place count 26 transition count 102
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 4 with 12 rules applied. Total rules applied 317 place count 20 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 19 transition count 95
Applied a total of 318 rules in 24 ms. Remains 19 /135 variables (removed 116) and now considering 95/301 (removed 206) transitions.
[2024-06-01 08:28:56] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:28:56] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:28:56] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:28:56] [INFO ] Invariant cache hit.
[2024-06-01 08:28:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-01 08:28:56] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:28:56] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:28:56] [INFO ] Invariant cache hit.
[2024-06-01 08:28:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:28:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7439ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/135 places, 95/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7597 ms. Remains : 19/135 places, 95/301 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-13 finished in 7665 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((G(!G(p0)) U !X(F(p0))))&&X(p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 130 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 130 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 128 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 128 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 126 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 126 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 124 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 123 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 123 transition count 285
Applied a total of 28 rules in 10 ms. Remains 123 /135 variables (removed 12) and now considering 285/301 (removed 16) transitions.
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-06-01 08:29:04] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-06-01 08:29:04] [INFO ] Invariant cache hit.
[2024-06-01 08:29:04] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 285/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 9 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-06-01 08:29:04] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-06-01 08:29:04] [INFO ] Invariant cache hit.
[2024-06-01 08:29:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/135 places, 233/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 76/135 places, 233/301 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, true, true, p0]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLFireability-14 finished in 531 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||X(!p0)) U G(p1))))'
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 131 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 129 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 129 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 127 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 127 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 125 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 125 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 125 transition count 289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 124 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 124 transition count 287
Applied a total of 25 rules in 16 ms. Remains 124 /135 variables (removed 11) and now considering 287/301 (removed 14) transitions.
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
// Phase 1: matrix 280 rows 124 cols
[2024-06-01 08:29:04] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
[2024-06-01 08:29:04] [INFO ] Invariant cache hit.
[2024-06-01 08:29:04] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 287/301 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 106 transition count 270
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 106 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 106 transition count 264
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 100 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 100 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 94 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 94 transition count 252
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 88 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 88 transition count 246
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 82 transition count 240
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 82 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 77 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 77 transition count 235
Applied a total of 98 rules in 9 ms. Remains 77 /123 variables (removed 46) and now considering 235/287 (removed 52) transitions.
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
// Phase 1: matrix 228 rows 77 cols
[2024-06-01 08:29:04] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:29:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:29:04] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:29:04] [INFO ] Invariant cache hit.
[2024-06-01 08:29:05] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:29:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 77/135 places, 235/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 77/135 places, 235/301 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-15
Product exploration explored 100000 steps with 29 reset in 58 ms.
Product exploration explored 100000 steps with 122 reset in 73 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 : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
RANDOM walk for 40000 steps (34 resets) in 295 ms. (135 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (19 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
[2024-06-01 08:29:05] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:29:05] [INFO ] Invariant cache hit.
[2024-06-01 08:29:06] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 77/305 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/77 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 235/235 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2024-06-01 08:29:06] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:29:06] [INFO ] Invariant cache hit.
[2024-06-01 08:29:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 08:29:06] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:29:06] [INFO ] Invariant cache hit.
[2024-06-01 08:29:06] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:29:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-01 08:29:06] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:29:06] [INFO ] Invariant cache hit.
[2024-06-01 08:29:06] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:29:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:29:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:29:09] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 130/248 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:29:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:29:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:29:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 1/305 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 0/305 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 254 constraints, problems are : Problem set: 0 solved, 234 unsolved in 16961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:29:24] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:29:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 130/263 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 234/497 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 1/305 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 499 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 56/56 constraints]
After SMT, in 47372ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 47375ms
Finished structural reductions in LTL mode , in 1 iterations and 47479 ms. Remains : 77/77 places, 235/235 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 : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
RANDOM walk for 21475 steps (29 resets) in 92 ms. (230 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 41 reset in 53 ms.
Product exploration explored 100000 steps with 61 reset in 50 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1)]
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 235/235 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 77 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 19 place count 77 transition count 241
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 77 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 65 transition count 229
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 65 transition count 229
Performed 24 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 73 place count 65 transition count 234
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 65 transition count 159
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 162 place count 51 transition count 145
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 176 place count 51 transition count 145
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 188 place count 51 transition count 133
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 194 place count 51 transition count 133
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 206 place count 39 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 218 place count 39 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 218 rules in 13 ms. Remains 39 /77 variables (removed 38) and now considering 121/235 (removed 114) transitions.
[2024-06-01 08:29:55] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 08:29:55] [INFO ] Flow matrix only has 114 transitions (discarded 7 similar events)
// Phase 1: matrix 114 rows 39 cols
[2024-06-01 08:29:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:29:55] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:29:55] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 4 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:29:56] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 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 TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/152 variables, 39/72 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 73/145 constraints. Problems are: Problem set: 22 solved, 98 unsolved
[2024-06-01 08:29:57] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 1/146 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/146 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/147 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/147 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/147 constraints. Problems are: Problem set: 22 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 147 constraints, problems are : Problem set: 22 solved, 98 unsolved in 3821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 22 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 18/39 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 33/34 constraints. Problems are: Problem set: 22 solved, 98 unsolved
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/38 constraints. Problems are: Problem set: 22 solved, 98 unsolved
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 6/44 constraints. Problems are: Problem set: 22 solved, 98 unsolved
[2024-06-01 08:30:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/45 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 113/152 variables, 39/84 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 73/157 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 98/255 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/255 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 1/153 variables, 1/256 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/256 constraints. Problems are: Problem set: 22 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/256 constraints. Problems are: Problem set: 22 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 256 constraints, problems are : Problem set: 22 solved, 98 unsolved in 6656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 98/120 constraints, Known Traps: 44/44 constraints]
After SMT, in 10608ms problems are : Problem set: 22 solved, 98 unsolved
Search for dead transitions found 22 dead transitions in 10609ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/77 places, 99/235 transitions.
Graph (complete) has 143 edges and 39 vertex of which 22 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 22 /39 variables (removed 17) and now considering 99/99 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/77 places, 99/235 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10639 ms. Remains : 22/77 places, 99/235 transitions.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 235/235 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2024-06-01 08:30:05] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
// Phase 1: matrix 228 rows 77 cols
[2024-06-01 08:30:05] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:30:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:30:05] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:30:05] [INFO ] Invariant cache hit.
[2024-06-01 08:30:06] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:30:06] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-01 08:30:06] [INFO ] Flow matrix only has 228 transitions (discarded 7 similar events)
[2024-06-01 08:30:06] [INFO ] Invariant cache hit.
[2024-06-01 08:30:06] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 130/248 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 1/305 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 0/305 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 254 constraints, problems are : Problem set: 0 solved, 234 unsolved in 17211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:30:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:30:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 77/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 130/263 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 234/497 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 08:30:33] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 1/305 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 499 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 56/56 constraints]
After SMT, in 47575ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 47577ms
Finished structural reductions in LTL mode , in 1 iterations and 47686 ms. Remains : 77/77 places, 235/235 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-15 finished in 109022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : StigmergyCommit-PT-05a-LTLFireability-01
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 195 place count 39 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 208 place count 39 transition count 187
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 273 place count 39 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 39 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 33 transition count 116
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 299 place count 26 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 25 transition count 107
Applied a total of 300 rules in 20 ms. Remains 25 /135 variables (removed 110) and now considering 107/301 (removed 194) transitions.
[2024-06-01 08:30:53] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
// Phase 1: matrix 100 rows 25 cols
[2024-06-01 08:30:53] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:30:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:30:53] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:30:53] [INFO ] Invariant cache hit.
[2024-06-01 08:30:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:30:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 08:30:53] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:30:53] [INFO ] Invariant cache hit.
[2024-06-01 08:30:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 99/124 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 74/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/125 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2521 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:30:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 99/124 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 101/235 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/125 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 236 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 34/34 constraints]
After SMT, in 6811ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6812ms
Starting structural reductions in LI_LTL mode, iteration 1 : 25/135 places, 107/301 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6890 ms. Remains : 25/135 places, 107/301 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 14285 reset in 297 ms.
Product exploration explored 100000 steps with 14285 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:31:01] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:31:01] [INFO ] Invariant cache hit.
[2024-06-01 08:31:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:31:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 08:31:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:01] [INFO ] [Real]Added 75 Read/Feed constraints in 8 ms returned sat
[2024-06-01 08:31:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:31:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 08:31:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:31:01] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 88 transitions) in 6 ms.
[2024-06-01 08:31:01] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 107/107 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 101
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 0 with 12 rules applied. Total rules applied 18 place count 19 transition count 95
Applied a total of 18 rules in 5 ms. Remains 19 /25 variables (removed 6) and now considering 95/107 (removed 12) transitions.
[2024-06-01 08:31:01] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:31:01] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:31:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:31:01] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:01] [INFO ] Invariant cache hit.
[2024-06-01 08:31:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 08:31:01] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:31:01] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:01] [INFO ] Invariant cache hit.
[2024-06-01 08:31:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:31:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:31:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7429ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/25 places, 95/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7499 ms. Remains : 19/25 places, 95/107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:31:09] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:09] [INFO ] Invariant cache hit.
[2024-06-01 08:31:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:31:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 08:31:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:09] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:31:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 08:31:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:31:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 5 ms.
[2024-06-01 08:31:09] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 200 ms.
Product exploration explored 100000 steps with 14285 reset in 205 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:31:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:10] [INFO ] Invariant cache hit.
[2024-06-01 08:31:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:31:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:10] [INFO ] Invariant cache hit.
[2024-06-01 08:31:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:10] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 08:31:10] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:31:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:10] [INFO ] Invariant cache hit.
[2024-06-01 08:31:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7408ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7409ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7490 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-01 finished in 24248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : StigmergyCommit-PT-05a-LTLFireability-05
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 195 place count 39 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 208 place count 39 transition count 187
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 273 place count 39 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 39 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 33 transition count 116
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 299 place count 26 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 25 transition count 107
Applied a total of 300 rules in 20 ms. Remains 25 /135 variables (removed 110) and now considering 107/301 (removed 194) transitions.
[2024-06-01 08:31:18] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
// Phase 1: matrix 100 rows 25 cols
[2024-06-01 08:31:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:31:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:31:18] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:31:18] [INFO ] Invariant cache hit.
[2024-06-01 08:31:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 08:31:18] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:31:18] [INFO ] Invariant cache hit.
[2024-06-01 08:31:18] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 99/124 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 74/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/125 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 08:31:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 99/124 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 101/235 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/125 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 236 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 34/34 constraints]
After SMT, in 6852ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6854ms
Starting structural reductions in LI_LTL mode, iteration 1 : 25/135 places, 107/301 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6941 ms. Remains : 25/135 places, 107/301 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-05
Product exploration explored 100000 steps with 14285 reset in 210 ms.
Product exploration explored 100000 steps with 14285 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:31:25] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 08:31:25] [INFO ] Invariant cache hit.
[2024-06-01 08:31:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:31:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 08:31:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:26] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:31:26] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 08:31:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 10 ms returned sat
[2024-06-01 08:31:26] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 88 transitions) in 6 ms.
[2024-06-01 08:31:26] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 107/107 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 101
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 0 with 12 rules applied. Total rules applied 18 place count 19 transition count 95
Applied a total of 18 rules in 9 ms. Remains 19 /25 variables (removed 6) and now considering 95/107 (removed 12) transitions.
[2024-06-01 08:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 08:31:26] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:31:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:26] [INFO ] Invariant cache hit.
[2024-06-01 08:31:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 08:31:26] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:31:26] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:26] [INFO ] Invariant cache hit.
[2024-06-01 08:31:26] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7582ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/25 places, 95/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7652 ms. Remains : 19/25 places, 95/107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:31:34] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:34] [INFO ] Invariant cache hit.
[2024-06-01 08:31:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 08:31:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 08:31:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:34] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 08:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:31:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 08:31:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 08:31:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 7 ms.
[2024-06-01 08:31:34] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 207 ms.
Product exploration explored 100000 steps with 14285 reset in 211 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 08:31:34] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:34] [INFO ] Invariant cache hit.
[2024-06-01 08:31:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:31:34] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:34] [INFO ] Invariant cache hit.
[2024-06-01 08:31:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 08:31:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-01 08:31:34] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 08:31:34] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 08:31:34] [INFO ] Invariant cache hit.
[2024-06-01 08:31:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:31:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:31:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 08:31:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:31:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7636ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7637ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7711 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-05 finished in 24627 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))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05a-LTLFireability-07
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 133 transition count 225
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 92 rules applied. Total rules applied 168 place count 58 transition count 208
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 14 rules applied. Total rules applied 182 place count 53 transition count 199
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 187 place count 49 transition count 198
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 194 place count 42 transition count 191
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 42 transition count 191
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 264 place count 42 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 264 place count 42 transition count 122
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 276 place count 36 transition count 122
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 294 place count 27 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 300 place count 27 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 302 place count 26 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 303 place count 26 transition count 103
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 308 place count 21 transition count 98
Applied a total of 308 rules in 15 ms. Remains 21 /135 variables (removed 114) and now considering 98/301 (removed 203) transitions.
[2024-06-01 08:31:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
// Phase 1: matrix 91 rows 21 cols
[2024-06-01 08:31:42] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:31:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 08:31:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
[2024-06-01 08:31:42] [INFO ] Invariant cache hit.
[2024-06-01 08:31:42] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 27 sub problems to find dead transitions.
[2024-06-01 08:31:42] [INFO ] Flow matrix only has 91 transitions (discarded 7 similar events)
[2024-06-01 08:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 90/111 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 52 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 90/111 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 79 constraints, problems are : Problem set: 0 solved, 27 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 30/30 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1449ms
Starting structural reductions in LI_LTL mode, iteration 1 : 21/135 places, 98/301 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1542 ms. Remains : 21/135 places, 98/301 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 43 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p0)))
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property StigmergyCommit-PT-05a-LTLFireability-07 finished in 1933 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(!p0)) U G(p1))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05a-LTLFireability-15
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 133 transition count 230
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 160 place count 63 transition count 211
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 57 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 172 place count 57 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 52 transition count 200
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 194 place count 40 transition count 188
Iterating global reduction 3 with 12 rules applied. Total rules applied 206 place count 40 transition count 188
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 270 place count 40 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 270 place count 40 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 282 place count 34 transition count 118
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 294 place count 28 transition count 111
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 296 place count 28 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 27 transition count 110
Applied a total of 297 rules in 15 ms. Remains 27 /135 variables (removed 108) and now considering 110/301 (removed 191) transitions.
[2024-06-01 08:31:44] [INFO ] Flow matrix only has 103 transitions (discarded 7 similar events)
// Phase 1: matrix 103 rows 27 cols
[2024-06-01 08:31:44] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:31:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:31:44] [INFO ] Flow matrix only has 103 transitions (discarded 7 similar events)
[2024-06-01 08:31:44] [INFO ] Invariant cache hit.
[2024-06-01 08:31:44] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-01 08:31:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-06-01 08:31:44] [INFO ] Flow matrix only has 103 transitions (discarded 7 similar events)
[2024-06-01 08:31:44] [INFO ] Invariant cache hit.
[2024-06-01 08:31:44] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:31:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:31:46] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:31:46] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:31:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:31:46] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 102/129 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 75/131 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 132 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 6/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 102/129 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 75/131 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 104/235 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 236 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 28/28 constraints]
After SMT, in 6441ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6442ms
Starting structural reductions in LI_LTL mode, iteration 1 : 27/135 places, 110/301 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6521 ms. Remains : 27/135 places, 110/301 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLFireability-15
Product exploration explored 100000 steps with 17 reset in 59 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
Treatment of property StigmergyCommit-PT-05a-LTLFireability-15 finished in 6870 ms.
FORMULA StigmergyCommit-PT-05a-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 08:31:51] [INFO ] Flatten gal took : 22 ms
[2024-06-01 08:31:51] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 08:31:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 301 transitions and 2046 arcs took 5 ms.
Total runtime 552130 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-05a-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05a-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05a-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717230716804

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-05a-LTLFireability-01
ltl formula formula --ltl=/tmp/6016/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 301 transitions and 2046 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6016/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6016/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6016/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6016/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 314 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~39 levels ~10000 states ~180592 transitions
pnml2lts-mc( 3/ 4): ~39 levels ~20000 states ~442340 transitions
pnml2lts-mc( 3/ 4): ~39 levels ~40000 states ~939104 transitions
pnml2lts-mc( 3/ 4): ~39 levels ~80000 states ~2073740 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 151264
pnml2lts-mc( 0/ 4): unique states count: 151264
pnml2lts-mc( 0/ 4): unique transitions count: 4157847
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4010562
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 151770
pnml2lts-mc( 0/ 4): - cum. max stack depth: 155
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 151770 states 4172208 transitions, fanout: 27.490
pnml2lts-mc( 0/ 4): Total exploration time 1.300 sec (1.300 sec minimum, 1.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 116746, Transitions per second: 3209391
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 8.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05a-LTLFireability-02
ltl formula formula --ltl=/tmp/6016/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 301 transitions and 2046 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6016/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6016/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6016/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6016/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 313 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~40 levels ~10000 states ~155480 transitions
pnml2lts-mc( 1/ 4): ~40 levels ~20000 states ~345332 transitions
pnml2lts-mc( 3/ 4): ~39 levels ~40000 states ~782524 transitions
pnml2lts-mc( 3/ 4): ~39 levels ~80000 states ~1841944 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 151264
pnml2lts-mc( 0/ 4): unique states count: 151264
pnml2lts-mc( 0/ 4): unique transitions count: 4157852
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4011171
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 151727
pnml2lts-mc( 0/ 4): - cum. max stack depth: 158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 151727 states 4173211 transitions, fanout: 27.505
pnml2lts-mc( 0/ 4): Total exploration time 1.300 sec (1.300 sec minimum, 1.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 116713, Transitions per second: 3210162
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 8.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05a-LTLFireability-05
ltl formula formula --ltl=/tmp/6016/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 301 transitions and 2046 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6016/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6016/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6016/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6016/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 314 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~39 levels ~10000 states ~170116 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~20000 states ~369772 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~40000 states ~798200 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~80000 states ~1965888 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 151264
pnml2lts-mc( 0/ 4): unique states count: 151264
pnml2lts-mc( 0/ 4): unique transitions count: 4157847
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4008757
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 151523
pnml2lts-mc( 0/ 4): - cum. max stack depth: 156
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 151523 states 4166093 transitions, fanout: 27.495
pnml2lts-mc( 0/ 4): Total exploration time 1.230 sec (1.230 sec minimum, 1.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123189, Transitions per second: 3387068
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 8.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05a-LTLFireability-07
ltl formula formula --ltl=/tmp/6016/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 301 transitions and 2046 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6016/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6016/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6016/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6016/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 307 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~48!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3
pnml2lts-mc( 0/ 4): unique states count: 7077
pnml2lts-mc( 0/ 4): unique transitions count: 46440
pnml2lts-mc( 0/ 4): - self-loop count: 8678
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 30029
pnml2lts-mc( 0/ 4): - claim success count: 7122
pnml2lts-mc( 0/ 4): - cum. max stack depth: 222
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7131 states 47139 transitions, fanout: 6.610
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 101871, Transitions per second: 673414
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05a-LTLFireability-15
ltl formula formula --ltl=/tmp/6016/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 301 transitions and 2046 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6016/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6016/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6016/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6016/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 322 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~58 levels ~10000 states ~65376 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~43!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 120
pnml2lts-mc( 0/ 4): unique states count: 13686
pnml2lts-mc( 0/ 4): unique transitions count: 90486
pnml2lts-mc( 0/ 4): - self-loop count: 15577
pnml2lts-mc( 0/ 4): - claim dead count: 79
pnml2lts-mc( 0/ 4): - claim found count: 60466
pnml2lts-mc( 0/ 4): - claim success count: 13707
pnml2lts-mc( 0/ 4): - cum. max stack depth: 228
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13707 states 91386 transitions, fanout: 6.667
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 114225, Transitions per second: 761550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 8.8 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 304 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531700140"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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