MCC'2024- Execution of r536-tall-171690531700139

About the Execution of LTSMin+red for StigmergyCommit-PT-05a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1552.760	390695.00	455299.00	1186.50	FFTFTTFFTFFFFFFF	normal

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717230120179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
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:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:22:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:22:01] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 08:22:01] [INFO ] Transformed 220 places.
[2024-06-01 08:22:01] [INFO ] Transformed 1212 transitions.
[2024-06-01 08:22:01] [INFO ] Found NUPN structural information;
[2024-06-01 08:22:01] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 412/412 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 179 transition count 366
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 179 transition count 366
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 179 transition count 360
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 105 place count 162 transition count 340
Iterating global reduction 1 with 17 rules applied. Total rules applied 122 place count 162 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 162 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 158 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 158 transition count 333
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 156 transition count 331
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 156 transition count 331
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 154 transition count 329
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 154 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 153 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 153 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 153 transition count 327
Applied a total of 144 rules in 86 ms. Remains 153 /220 variables (removed 67) and now considering 327/412 (removed 85) transitions.
[2024-06-01 08:22:01] [INFO ] Flow matrix only has 317 transitions (discarded 10 similar events)
// Phase 1: matrix 317 rows 153 cols
[2024-06-01 08:22:01] [INFO ] Computed 4 invariants in 17 ms
[2024-06-01 08:22:02] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 08:22:02] [INFO ] Flow matrix only has 317 transitions (discarded 10 similar events)
[2024-06-01 08:22:02] [INFO ] Invariant cache hit.
[2024-06-01 08:22:02] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-06-01 08:22:02] [INFO ] Implicit Places using invariants and state equation in 301 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 668 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/220 places, 327/412 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 315
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 140 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 134 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 134 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 131 transition count 301
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 131 transition count 301
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 128 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 128 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 125 transition count 295
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 125 transition count 295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 123 transition count 293
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 123 transition count 293
Applied a total of 63 rules in 14 ms. Remains 123 /152 variables (removed 29) and now considering 293/327 (removed 34) transitions.
[2024-06-01 08:22:02] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
// Phase 1: matrix 283 rows 123 cols
[2024-06-01 08:22:02] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 08:22:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 08:22:02] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
[2024-06-01 08:22:02] [INFO ] Invariant cache hit.
[2024-06-01 08:22:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:22:02] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/220 places, 293/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 958 ms. Remains : 123/220 places, 293/412 transitions.
Support contains 36 out of 123 places after structural reductions.
[2024-06-01 08:22:02] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:22:02] [INFO ] Flatten gal took : 23 ms
[2024-06-01 08:22:02] [INFO ] Input system was already deterministic with 293 transitions.
Support contains 34 out of 123 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (30 resets) in 2596 ms. (15 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (9 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2024-06-01 08:22:03] [INFO ] Flow matrix only has 283 transitions (discarded 10 similar events)
[2024-06-01 08:22:03] [INFO ] Invariant cache hit.
[2024-06-01 08:22:03] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/405 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 130/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 24/406 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/123 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 123 transition count 240
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 70 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 69 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 68 transition count 231
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 117 place count 68 transition count 223
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 133 place count 60 transition count 223
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 140 place count 53 transition count 213
Iterating global reduction 4 with 7 rules applied. Total rules applied 147 place count 53 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 151 place count 53 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 53 transition count 208
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 52 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 51 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 51 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 51 transition count 202
Performed 26 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 211 place count 25 transition count 163
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 240 place count 25 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 334 place count 25 transition count 40
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 346 place count 19 transition count 34
Applied a total of 346 rules in 56 ms. Remains 19 /123 variables (removed 104) and now considering 34/293 (removed 259) transitions.
[2024-06-01 08:22:04] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
// Phase 1: matrix 28 rows 19 cols
[2024-06-01 08:22:04] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:22:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:22:04] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
[2024-06-01 08:22:04] [INFO ] Invariant cache hit.
[2024-06-01 08:22:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 08:22:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 08:22:04] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 08:22:04] [INFO ] Flow matrix only has 28 transitions (discarded 6 similar events)
[2024-06-01 08:22:04] [INFO ] Invariant cache hit.
[2024-06-01 08:22:04] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 4 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 3 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:22:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [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/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 27/46 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 08:22:05] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1/47 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 66 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 27/46 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 33/98 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 99 constraints, problems are : Problem set: 0 solved, 33 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 32/32 constraints]
After SMT, in 2408ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2409ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/123 places, 34/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2544 ms. Remains : 19/123 places, 34/293 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-00 finished in 2756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 275
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 273
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 95 transition count 260
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 95 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 95 transition count 257
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 87 transition count 249
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 87 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 87 transition count 247
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 82 transition count 242
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 82 transition count 242
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 80 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 80 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 80 transition count 239
Applied a total of 94 rules in 10 ms. Remains 80 /123 variables (removed 43) and now considering 239/293 (removed 54) transitions.
[2024-06-01 08:22:07] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
// Phase 1: matrix 231 rows 80 cols
[2024-06-01 08:22:07] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:22:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 08:22:07] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
[2024-06-01 08:22:07] [INFO ] Invariant cache hit.
[2024-06-01 08:22:07] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:22:07] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-01 08:22:07] [INFO ] Flow matrix only has 231 transitions (discarded 8 similar events)
[2024-06-01 08:22:07] [INFO ] Invariant cache hit.
[2024-06-01 08:22:07] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:22:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 7 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 7 ms to minimize.
[2024-06-01 08:22:09] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:22:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 230/310 variables, 80/143 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 130/273 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:22:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/311 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/311 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 279 constraints, problems are : Problem set: 0 solved, 238 unsolved in 15282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 230/310 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 238/516 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 1/311 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:22:40] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 519 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 68/68 constraints]
After SMT, in 45859ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 45864ms
Starting structural reductions in LTL mode, iteration 1 : 80/123 places, 239/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46015 ms. Remains : 80/123 places, 239/293 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-01 finished in 46163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 272
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 96 transition count 260
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 96 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 96 transition count 257
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 90 transition count 251
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 90 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 90 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 86 transition count 246
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 86 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 85 transition count 245
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 85 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 85 transition count 244
Applied a total of 83 rules in 9 ms. Remains 85 /123 variables (removed 38) and now considering 244/293 (removed 49) transitions.
[2024-06-01 08:22:53] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
// Phase 1: matrix 237 rows 85 cols
[2024-06-01 08:22:53] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:22:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 08:22:53] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-06-01 08:22:53] [INFO ] Invariant cache hit.
[2024-06-01 08:22:53] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:22:53] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-06-01 08:22:53] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-06-01 08:22:53] [INFO ] Invariant cache hit.
[2024-06-01 08:22:53] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:22:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:22:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:22:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/130 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:23:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:23:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:23:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:23:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 17886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:23:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:23:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 513 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 53/53 constraints]
After SMT, in 48586ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 48589ms
Starting structural reductions in LTL mode, iteration 1 : 85/123 places, 244/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48727 ms. Remains : 85/123 places, 244/293 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 81 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 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 24859 steps (21 resets) in 149 ms. (165 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 84 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 244/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-06-01 08:23:42] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-06-01 08:23:42] [INFO ] Invariant cache hit.
[2024-06-01 08:23:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 08:23:43] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-06-01 08:23:43] [INFO ] Invariant cache hit.
[2024-06-01 08:23:43] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:23:43] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-06-01 08:23:43] [INFO ] Flow matrix only has 237 transitions (discarded 7 similar events)
[2024-06-01 08:23:43] [INFO ] Invariant cache hit.
[2024-06-01 08:23:43] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:23:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:23:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:23:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:23:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:23:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:23:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/130 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:23:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:23:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:23:50] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:23:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:23:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 266 constraints, problems are : Problem set: 0 solved, 243 unsolved in 18572 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:24:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:24:03] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:24:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 08:24:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 236/321 variables, 85/139 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 513 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 53/53 constraints]
After SMT, in 48984ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 48986ms
Finished structural reductions in LTL mode , in 1 iterations and 49159 ms. Remains : 85/85 places, 244/244 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 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 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21306 steps (22 resets) in 124 ms. (170 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 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Entered a terminal (fully accepting) state of product in 341 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-03 finished in 99610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 275
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 107 transition count 273
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 95 transition count 261
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 95 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 95 transition count 258
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 88 transition count 251
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 88 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 88 transition count 249
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 83 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 83 transition count 244
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 81 transition count 242
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 81 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 81 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 80 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 80 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 80 transition count 239
Applied a total of 95 rules in 11 ms. Remains 80 /123 variables (removed 43) and now considering 239/293 (removed 54) transitions.
[2024-06-01 08:24:32] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 80 cols
[2024-06-01 08:24:32] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:24:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 08:24:32] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:24:32] [INFO ] Invariant cache hit.
[2024-06-01 08:24:32] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:24:33] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-01 08:24:33] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:24:33] [INFO ] Invariant cache hit.
[2024-06-01 08:24:33] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:24:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:24:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:24:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:24:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:24:38] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 229/309 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:24:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/310 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 270 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:24:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:24:52] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:24:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 229/309 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 238/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 515 constraints, problems are : Problem set: 0 solved, 238 unsolved in 27778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 64/64 constraints]
After SMT, in 44450ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 44453ms
Starting structural reductions in LTL mode, iteration 1 : 80/123 places, 239/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44604 ms. Remains : 80/123 places, 239/293 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-04
Product exploration explored 100000 steps with 20000 reset in 127 ms.
Product exploration explored 100000 steps with 20000 reset in 119 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 523 steps (1 resets) in 10 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 239/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 08:25:18] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:25:18] [INFO ] Invariant cache hit.
[2024-06-01 08:25:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 08:25:18] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:25:18] [INFO ] Invariant cache hit.
[2024-06-01 08:25:18] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:25:18] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-01 08:25:18] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:25:18] [INFO ] Invariant cache hit.
[2024-06-01 08:25:18] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:25:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 229/309 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:25:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/310 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 270 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:25:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:25:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:25:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:25:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:25:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 229/309 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 238/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 515 constraints, problems are : Problem set: 0 solved, 238 unsolved in 27072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 64/64 constraints]
After SMT, in 43792ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 43795ms
Finished structural reductions in LTL mode , in 1 iterations and 43942 ms. Remains : 80/80 places, 239/239 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 395 steps (0 resets) in 9 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 157 ms.
Product exploration explored 100000 steps with 20000 reset in 136 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 239/239 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 80 transition count 239
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 20 place count 80 transition count 245
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 80 transition count 245
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 38 place count 68 transition count 233
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 68 transition count 233
Performed 30 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 80 place count 68 transition count 238
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 128 place count 68 transition count 190
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 149 place count 47 transition count 169
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 170 place count 47 transition count 169
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 272 place count 47 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 278 place count 47 transition count 67
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 289 place count 36 transition count 56
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 300 place count 36 transition count 56
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 300 rules in 39 ms. Remains 36 /80 variables (removed 44) and now considering 56/239 (removed 183) transitions.
[2024-06-01 08:26:04] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-06-01 08:26:04] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
// Phase 1: matrix 48 rows 36 cols
[2024-06-01 08:26:04] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:26:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 20/22 constraints. Problems are: Problem set: 4 solved, 51 unsolved
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/30 constraints. Problems are: Problem set: 4 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 51 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 5 (OVERLAPS) 47/83 variables, 36/66 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 9/75 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/75 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/84 variables, 1/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/76 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 76 constraints, problems are : Problem set: 24 solved, 31 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 24 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 19/36 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 28/30 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/33 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/34 constraints. Problems are: Problem set: 24 solved, 31 unsolved
[2024-06-01 08:26:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/35 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 47/83 variables, 36/71 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 9/80 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 31/111 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/111 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/112 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 112 constraints, problems are : Problem set: 24 solved, 31 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 31/55 constraints, Known Traps: 33/33 constraints]
After SMT, in 2392ms problems are : Problem set: 24 solved, 31 unsolved
Search for dead transitions found 24 dead transitions in 2393ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 36/80 places, 32/239 transitions.
Graph (complete) has 116 edges and 36 vertex of which 18 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 18 /36 variables (removed 18) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/80 places, 32/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2451 ms. Remains : 18/80 places, 32/239 transitions.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 239/239 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 08:26:06] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
// Phase 1: matrix 230 rows 80 cols
[2024-06-01 08:26:06] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:26:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 08:26:06] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:26:06] [INFO ] Invariant cache hit.
[2024-06-01 08:26:06] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:26:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-01 08:26:06] [INFO ] Flow matrix only has 230 transitions (discarded 9 similar events)
[2024-06-01 08:26:06] [INFO ] Invariant cache hit.
[2024-06-01 08:26:06] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:26:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:26:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:26:11] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 229/309 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/310 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/310 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 270 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:24] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:26:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:26:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:26:25] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 08:26:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:26:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 229/309 variables, 80/146 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 238/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/310 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/310 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 515 constraints, problems are : Problem set: 0 solved, 238 unsolved in 28306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 64/64 constraints]
After SMT, in 44879ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 44882ms
Finished structural reductions in LTL mode , in 1 iterations and 45027 ms. Remains : 80/80 places, 239/239 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-04 finished in 138916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(G(!p1))) U G((!p2 U p3)))))'
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 108 transition count 275
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 108 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 108 transition count 273
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 263
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 99 transition count 262
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 93 transition count 256
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 93 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 93 transition count 255
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 90 transition count 252
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 90 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 89 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 89 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 88 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 88 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 88 transition count 249
Applied a total of 75 rules in 8 ms. Remains 88 /123 variables (removed 35) and now considering 249/293 (removed 44) transitions.
[2024-06-01 08:26:51] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
// Phase 1: matrix 242 rows 88 cols
[2024-06-01 08:26:51] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:26:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:26:51] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-06-01 08:26:51] [INFO ] Invariant cache hit.
[2024-06-01 08:26:52] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 08:26:52] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-01 08:26:52] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-06-01 08:26:52] [INFO ] Invariant cache hit.
[2024-06-01 08:26:52] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 16 places in 45 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 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:26:53] [INFO ] Deduced a trap composed of 13 places in 48 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.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 43 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 13 places in 40 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 28 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 0 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 13 places in 22 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 1 ms to minimize.
[2024-06-01 08:26:54] [INFO ] Deduced a trap composed of 15 places in 32 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 34 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 0 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:26:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:26:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:26:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 241/329 variables, 88/136 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 130/266 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/330 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 267 constraints, problems are : Problem set: 0 solved, 248 unsolved in 17089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:27:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:27:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-01 08:27:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 241/329 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 130/269 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 248/517 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/330 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 518 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 50/50 constraints]
After SMT, in 47500ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 47503ms
Starting structural reductions in LTL mode, iteration 1 : 88/123 places, 249/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47801 ms. Remains : 88/123 places, 249/293 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p3), (NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 164 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (30 resets) in 506 ms. (78 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
[2024-06-01 08:27:40] [INFO ] Flow matrix only has 242 transitions (discarded 7 similar events)
[2024-06-01 08:27:40] [INFO ] Invariant cache hit.
[2024-06-01 08:27:40] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 241/329 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 130/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/330 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 220 constraints, problems are : Problem set: 0 solved, 4 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
[2024-06-01 08:27:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 4 ms to minimize.
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 88/330 variables, and 32 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 1658ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (G (OR (NOT p0) p3 p2)), (G (OR p0 p3 p2)), (G (OR p0 p3 (NOT p2))), (G (OR p3 p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (AND p0 p3) (AND p0 (NOT p2))))), (F (NOT (OR p3 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (OR p0 (NOT p3)) (OR p0 p2)))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 26 factoid took 463 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p3), true, p1, (NOT p3)]
Support contains 7 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 249/249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 88 transition count 228
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 67 transition count 228
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 67 transition count 222
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 61 transition count 222
Performed 28 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 110 place count 33 transition count 182
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 129 place count 33 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 3 with 102 rules applied. Total rules applied 231 place count 33 transition count 61
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 243 place count 27 transition count 55
Applied a total of 243 rules in 18 ms. Remains 27 /88 variables (removed 61) and now considering 55/249 (removed 194) transitions.
[2024-06-01 08:27:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 27 cols
[2024-06-01 08:27:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:27:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:27:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-06-01 08:27:43] [INFO ] Invariant cache hit.
[2024-06-01 08:27:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 08:27:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 08:27:43] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 08:27:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-06-01 08:27:43] [INFO ] Invariant cache hit.
[2024-06-01 08:27:43] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:27:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:27:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 48/75 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 1/76 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/76 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 92 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 48/75 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 54/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 146 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 37/37 constraints]
After SMT, in 4203ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 4204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/88 places, 55/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4288 ms. Remains : 27/88 places, 55/249 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 14 factoid took 202 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p3), true, p1, (NOT p3)]
RANDOM walk for 40000 steps (1730 resets) in 125 ms. (317 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (356 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-06-01 08:27:48] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-06-01 08:27:48] [INFO ] Invariant cache hit.
[2024-06-01 08:27:48] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/76 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Int declared 27/76 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/27 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 263ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (G (OR p0 p3))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p3))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p3))), (F (NOT (OR p0 (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 336 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), true, p1, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 55/55 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 25 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 25 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 25 transition count 52
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 3 with 2 rules applied. Total rules applied 7 place count 24 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 12 place count 24 transition count 46
Applied a total of 12 rules in 10 ms. Remains 24 /27 variables (removed 3) and now considering 46/55 (removed 9) transitions.
[2024-06-01 08:27:49] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
// Phase 1: matrix 39 rows 24 cols
[2024-06-01 08:27:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:27:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 08:27:49] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2024-06-01 08:27:49] [INFO ] Invariant cache hit.
[2024-06-01 08:27:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 08:27:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 08:27:49] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 08:27:49] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2024-06-01 08:27:49] [INFO ] Invariant cache hit.
[2024-06-01 08:27:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:27: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/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:27:49] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:27:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 38/62 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 1/63 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 78 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 08:27:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 38/62 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 1/63 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/63 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 124 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 34/34 constraints]
After SMT, in 3282ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 46/55 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3377 ms. Remains : 24/27 places, 46/55 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-09 finished in 60942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 123 transition count 243
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 105 place count 73 transition count 238
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 72 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 70 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 111 place count 70 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 127 place count 62 transition count 227
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 133 place count 56 transition count 218
Iterating global reduction 4 with 6 rules applied. Total rules applied 139 place count 56 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 146 place count 56 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 146 place count 56 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 55 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 54 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 54 transition count 208
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 158 place count 54 transition count 200
Performed 27 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 212 place count 27 transition count 161
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 6 with 54 rules applied. Total rules applied 266 place count 27 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 7 with 68 rules applied. Total rules applied 334 place count 27 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 346 place count 21 transition count 33
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 349 place count 21 transition count 33
Applied a total of 349 rules in 30 ms. Remains 21 /123 variables (removed 102) and now considering 33/293 (removed 260) transitions.
[2024-06-01 08:27:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 21 cols
[2024-06-01 08:27:52] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:27:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:27:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 08:27:52] [INFO ] Invariant cache hit.
[2024-06-01 08:27:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 08:27:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-01 08:27:52] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 08:27:52] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 08:27:52] [INFO ] Invariant cache hit.
[2024-06-01 08:27:52] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 08:27:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 25/46 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 08:27:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 25/46 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 32/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 101 constraints, problems are : Problem set: 0 solved, 32 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 36/36 constraints]
After SMT, in 2215ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2215ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/123 places, 33/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2331 ms. Remains : 21/123 places, 33/293 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 192 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 5 in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-12 finished in 2583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 122 transition count 239
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 113 place count 69 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 68 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 67 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 117 place count 67 transition count 222
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 133 place count 59 transition count 222
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 138 place count 54 transition count 215
Iterating global reduction 4 with 5 rules applied. Total rules applied 143 place count 54 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 54 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 146 place count 54 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 53 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 52 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 52 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 154 place count 52 transition count 205
Performed 22 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 198 place count 30 transition count 174
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 229 place count 30 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 233 place count 28 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 235 place count 28 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 8 with 87 rules applied. Total rules applied 322 place count 28 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 334 place count 22 transition count 46
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 338 place count 18 transition count 42
Applied a total of 338 rules in 29 ms. Remains 18 /123 variables (removed 105) and now considering 42/293 (removed 251) transitions.
[2024-06-01 08:27:55] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 18 cols
[2024-06-01 08:27:55] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:27:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 08:27:55] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-06-01 08:27:55] [INFO ] Invariant cache hit.
[2024-06-01 08:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:27:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 08:27:55] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 08:27:55] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-06-01 08:27:55] [INFO ] Invariant cache hit.
[2024-06-01 08:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:27:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 35/53 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/54 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/54 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 50 constraints, problems are : Problem set: 0 solved, 19 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 35/53 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 71 constraints, problems are : Problem set: 0 solved, 19 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 32/32 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1307ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/123 places, 42/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1400 ms. Remains : 18/123 places, 42/293 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-13 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 122 transition count 242
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 106 place count 72 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 71 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 69 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 69 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 61 transition count 225
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 55 transition count 216
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 55 transition count 216
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 147 place count 55 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 147 place count 55 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 54 transition count 208
Performed 23 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 195 place count 31 transition count 174
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 225 place count 31 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 29 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 231 place count 29 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 7 with 94 rules applied. Total rules applied 325 place count 29 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 337 place count 23 transition count 40
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 341 place count 19 transition count 36
Applied a total of 341 rules in 35 ms. Remains 19 /123 variables (removed 104) and now considering 36/293 (removed 257) transitions.
[2024-06-01 08:27:56] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
// Phase 1: matrix 30 rows 19 cols
[2024-06-01 08:27:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:27:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 08:27:56] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-06-01 08:27:56] [INFO ] Invariant cache hit.
[2024-06-01 08:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:27:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 08:27:56] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 08:27:56] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-06-01 08:27:56] [INFO ] Invariant cache hit.
[2024-06-01 08:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 29/48 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:27:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 53 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 29/48 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 73 constraints, problems are : Problem set: 0 solved, 19 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 33/33 constraints]
After SMT, in 1352ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/123 places, 36/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1455 ms. Remains : 19/123 places, 36/293 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-15 finished in 1585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-05a-LTLCardinality-04
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 122 transition count 235
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 121 place count 65 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 64 transition count 227
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 123 place count 64 transition count 219
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 139 place count 56 transition count 219
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 52 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 52 transition count 213
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 52 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 52 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 51 transition count 205
Performed 22 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 200 place count 29 transition count 172
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 230 place count 29 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 27 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 236 place count 27 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 27 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 238 place count 27 transition count 137
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 242 place count 23 transition count 133
Applied a total of 242 rules in 32 ms. Remains 23 /123 variables (removed 100) and now considering 133/293 (removed 160) transitions.
[2024-06-01 08:27:58] [INFO ] Flow matrix only has 124 transitions (discarded 9 similar events)
// Phase 1: matrix 124 rows 23 cols
[2024-06-01 08:27:58] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:27:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:27:58] [INFO ] Flow matrix only has 124 transitions (discarded 9 similar events)
[2024-06-01 08:27:58] [INFO ] Invariant cache hit.
[2024-06-01 08:27:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 31 sub problems to find dead transitions.
[2024-06-01 08:27:58] [INFO ] Flow matrix only has 124 transitions (discarded 9 similar events)
[2024-06-01 08:27:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:27:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 123/146 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:27:59] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 54 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 123/146 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 31/86 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 86 constraints, problems are : Problem set: 0 solved, 31 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 30/30 constraints]
After SMT, in 1948ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1948ms
Starting structural reductions in LI_LTL mode, iteration 1 : 23/123 places, 133/293 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2059 ms. Remains : 23/123 places, 133/293 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-04
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 0 ms.
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-04 finished in 2351 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(G(!p1))) U G((!p2 U p3)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05a-LTLCardinality-09
Stuttering acceptance computed with spot in 263 ms :[(NOT p3), (NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 123/123 places, 293/293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 123 transition count 248
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 96 place count 78 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 75 transition count 242
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 99 place count 75 transition count 234
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 115 place count 67 transition count 234
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 122 place count 60 transition count 224
Iterating global reduction 3 with 7 rules applied. Total rules applied 129 place count 60 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 133 place count 60 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 59 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 59 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 139 place count 59 transition count 214
Performed 26 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 191 place count 33 transition count 175
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 203 place count 33 transition count 163
Applied a total of 203 rules in 19 ms. Remains 33 /123 variables (removed 90) and now considering 163/293 (removed 130) transitions.
[2024-06-01 08:28:01] [INFO ] Flow matrix only has 156 transitions (discarded 7 similar events)
// Phase 1: matrix 156 rows 33 cols
[2024-06-01 08:28:01] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:28:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 08:28:01] [INFO ] Flow matrix only has 156 transitions (discarded 7 similar events)
[2024-06-01 08:28:01] [INFO ] Invariant cache hit.
[2024-06-01 08:28:01] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 08:28:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 08:28:01] [INFO ] Flow matrix only has 156 transitions (discarded 7 similar events)
[2024-06-01 08:28:01] [INFO ] Invariant cache hit.
[2024-06-01 08:28:01] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 155/188 variables, 33/64 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 121/185 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 186 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 08:28:07] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 155/188 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 121/186 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 162/348 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 349 constraints, problems are : Problem set: 0 solved, 162 unsolved in 10507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 31/31 constraints]
After SMT, in 16487ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16488ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/123 places, 163/293 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16605 ms. Remains : 33/123 places, 163/293 transitions.
Running random walk in product with property : StigmergyCommit-PT-05a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 227 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p3), true, p1, (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (311 resets) in 632 ms. (63 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (15 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (52 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2024-06-01 08:28:18] [INFO ] Flow matrix only has 156 transitions (discarded 7 similar events)
[2024-06-01 08:28:18] [INFO ] Invariant cache hit.
[2024-06-01 08:28:18] [INFO ] State equation strengthened by 122 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 155/188 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/189 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:19] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 33/189 variables, and 19 constraints, problems are : Problem set: 4 solved, 0 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/33 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 867ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR (AND p3 p0) (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (OR p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 p0) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X p0)), (G (OR (NOT p0) p3 p2)), (G (OR p0 p3 p2)), (G (OR p0 p3 (NOT p2))), (G (OR p3 p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (AND p0 p3) (AND p0 (NOT p2))))), (F (NOT (OR p3 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (OR p0 (NOT p3)) (OR p0 p2)))), (F (NOT p2)), (F (NOT (OR p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 26 factoid took 507 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p3), true, p1, (NOT p3)]
Support contains 7 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 163/163 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 33 transition count 65
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 110 place count 27 transition count 59
Applied a total of 110 rules in 9 ms. Remains 27 /33 variables (removed 6) and now considering 59/163 (removed 104) transitions.
[2024-06-01 08:28:20] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 27 cols
[2024-06-01 08:28:20] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:28:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:28:20] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-06-01 08:28:20] [INFO ] Invariant cache hit.
[2024-06-01 08:28:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 08:28:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 08:28:20] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 08:28:20] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-06-01 08:28:20] [INFO ] Invariant cache hit.
[2024-06-01 08:28:20] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:28:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:28:21] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 52/79 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 30/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/80 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 08:28:22] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 92 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 52/79 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 58/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/80 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 150 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 33/33 constraints]
After SMT, in 4296ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/33 places, 59/163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4375 ms. Remains : 27/33 places, 59/163 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 14 factoid took 175 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p3), true, p1, (NOT p3)]
RANDOM walk for 40000 steps (1529 resets) in 114 ms. (347 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (317 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-01 08:28:25] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-06-01 08:28:25] [INFO ] Invariant cache hit.
[2024-06-01 08:28:25] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/79 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 59 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Int declared 27/80 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/27 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 277ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1), (X (AND p0 p3)), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p1)), (X p0), (X (X (AND p0 p3))), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (G (OR p0 p3))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p3))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p3))), (F (NOT (OR p0 (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 329 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p3), true, p1, (NOT p3)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), true, p1, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 59/59 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 25 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 25 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 25 transition count 56
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 3 with 2 rules applied. Total rules applied 7 place count 24 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 24 transition count 49
Applied a total of 13 rules in 4 ms. Remains 24 /27 variables (removed 3) and now considering 49/59 (removed 10) transitions.
[2024-06-01 08:28:26] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 24 cols
[2024-06-01 08:28:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:28:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 08:28:26] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-06-01 08:28:26] [INFO ] Invariant cache hit.
[2024-06-01 08:28:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 08:28:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 08:28:26] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 08:28:26] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-06-01 08:28:26] [INFO ] Invariant cache hit.
[2024-06-01 08:28:26] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:28:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 08:28:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 41/65 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:28:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 41/65 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 48/126 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 127 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 3680ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 49/59 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3784 ms. Remains : 24/27 places, 49/59 transitions.
Treatment of property StigmergyCommit-PT-05a-LTLCardinality-09 finished in 29432 ms.
[2024-06-01 08:28:30] [INFO ] Flatten gal took : 17 ms
[2024-06-01 08:28:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-06-01 08:28:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 293 transitions and 1921 arcs took 5 ms.
Total runtime 388916 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-05a-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05a-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717230510874

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-05a-LTLCardinality-04
ltl formula formula --ltl=/tmp/4274/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 123 places, 293 transitions and 1921 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.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4274/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4274/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4274/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4274/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 125 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 124, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 85
pnml2lts-mc( 0/ 4): unique states count: 85
pnml2lts-mc( 0/ 4): unique transitions count: 169
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 119
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 120
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 120 states 308 transitions, fanout: 2.567
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.4 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 296 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05a-LTLCardinality-09
ltl formula formula --ltl=/tmp/4274/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 123 places, 293 transitions and 1921 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/4274/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4274/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4274/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4274/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 124 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 124, there are 2137 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): ~57 levels ~10000 states ~138848 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~44!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 11117
pnml2lts-mc( 0/ 4): unique transitions count: 191707
pnml2lts-mc( 0/ 4): - self-loop count: 33783
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 144960
pnml2lts-mc( 0/ 4): - claim success count: 11136
pnml2lts-mc( 0/ 4): - cum. max stack depth: 231
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11136 states 192675 transitions, fanout: 17.302
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 79543, Transitions per second: 1376250
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.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 296 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="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-05a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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