fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690529800203
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for StigmergyCommit-PT-09a

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4337.495 498020.00 651472.00 1538.30 TTFTFTTFTFFFFTTT 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.r399-tall-171690529800203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529800203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 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 51M 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-09a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716995791331

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 15:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 15:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:16:34] [INFO ] Load time of PNML (sax parser for PT used): 2098 ms
[2024-05-29 15:16:34] [INFO ] Transformed 364 places.
[2024-05-29 15:16:35] [INFO ] Transformed 50444 transitions.
[2024-05-29 15:16:35] [INFO ] Found NUPN structural information;
[2024-05-29 15:16:35] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 292 transition count 2441
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 292 transition count 2441
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 152 place count 292 transition count 2433
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 185 place count 259 transition count 2393
Iterating global reduction 1 with 33 rules applied. Total rules applied 218 place count 259 transition count 2393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 227 place count 259 transition count 2384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 233 place count 253 transition count 2378
Iterating global reduction 2 with 6 rules applied. Total rules applied 239 place count 253 transition count 2378
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 248 transition count 2373
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 248 transition count 2373
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 243 transition count 2368
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 243 transition count 2368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 238 transition count 2363
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 238 transition count 2363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 274 place count 238 transition count 2358
Applied a total of 274 rules in 249 ms. Remains 238 /364 variables (removed 126) and now considering 2358/2520 (removed 162) transitions.
[2024-05-29 15:16:35] [INFO ] Flow matrix only has 2344 transitions (discarded 14 similar events)
// Phase 1: matrix 2344 rows 238 cols
[2024-05-29 15:16:35] [INFO ] Computed 2 invariants in 67 ms
[2024-05-29 15:16:36] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-29 15:16:36] [INFO ] Flow matrix only has 2344 transitions (discarded 14 similar events)
[2024-05-29 15:16:36] [INFO ] Invariant cache hit.
[2024-05-29 15:16:37] [INFO ] State equation strengthened by 2149 read => feed constraints.
[2024-05-29 15:16:39] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/364 places, 2358/2520 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 2334
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 2334
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 213 transition count 2327
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 204 transition count 2318
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 204 transition count 2318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 197 transition count 2311
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 197 transition count 2311
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 190 transition count 2304
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 190 transition count 2304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 185 transition count 2299
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 185 transition count 2299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 181 transition count 2295
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 181 transition count 2295
Applied a total of 119 rules in 80 ms. Remains 181 /237 variables (removed 56) and now considering 2295/2358 (removed 63) transitions.
[2024-05-29 15:16:39] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
// Phase 1: matrix 2281 rows 181 cols
[2024-05-29 15:16:39] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 15:16:40] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-29 15:16:40] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
[2024-05-29 15:16:40] [INFO ] Invariant cache hit.
[2024-05-29 15:16:41] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:16:42] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/364 places, 2295/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6468 ms. Remains : 181/364 places, 2295/2520 transitions.
Support contains 24 out of 181 places after structural reductions.
[2024-05-29 15:16:42] [INFO ] Flatten gal took : 385 ms
[2024-05-29 15:16:42] [INFO ] Flatten gal took : 279 ms
[2024-05-29 15:16:43] [INFO ] Input system was already deterministic with 2295 transitions.
RANDOM walk for 40000 steps (8 resets) in 6372 ms. (6 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
[2024-05-29 15:16:45] [INFO ] Flow matrix only has 2281 transitions (discarded 14 similar events)
[2024-05-29 15:16:45] [INFO ] Invariant cache hit.
[2024-05-29 15:16:45] [INFO ] State equation strengthened by 2055 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 165/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2280/2461 variables, 181/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2461 variables, 2054/2236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2461 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/2462 variables, 1/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2462 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/2462 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2462/2462 variables, and 2237 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 181/181 constraints, ReadFeed: 2055/2055 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 165/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 15:16:48] [INFO ] Deduced a trap composed of 13 places in 746 ms of which 22 ms to minimize.
[2024-05-29 15:16:49] [INFO ] Deduced a trap composed of 13 places in 748 ms of which 2 ms to minimize.
[2024-05-29 15:16:50] [INFO ] Deduced a trap composed of 13 places in 711 ms of which 2 ms to minimize.
[2024-05-29 15:16:50] [INFO ] Deduced a trap composed of 15 places in 692 ms of which 2 ms to minimize.
[2024-05-29 15:16:51] [INFO ] Deduced a trap composed of 17 places in 715 ms of which 2 ms to minimize.
[2024-05-29 15:16:52] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2024-05-29 15:16:52] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 2 ms to minimize.
[2024-05-29 15:16:53] [INFO ] Deduced a trap composed of 17 places in 584 ms of which 2 ms to minimize.
SMT process timed out in 7838ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Graph (complete) has 533 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 180 transition count 2199
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 97 rules applied. Total rules applied 193 place count 109 transition count 2173
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 205 place count 98 transition count 2172
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 205 place count 98 transition count 2167
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 215 place count 93 transition count 2167
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 227 place count 81 transition count 2155
Iterating global reduction 3 with 12 rules applied. Total rules applied 239 place count 81 transition count 2155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 81 transition count 2153
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 247 place count 75 transition count 2147
Iterating global reduction 4 with 6 rules applied. Total rules applied 253 place count 75 transition count 2147
Performed 35 Post agglomeration using F-continuation condition with reduction of 2001 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 71 rules applied. Total rules applied 324 place count 39 transition count 111
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 384 place count 39 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 393 place count 39 transition count 42
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 5 with 2 rules applied. Total rules applied 395 place count 38 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 397 place count 37 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 36 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 399 place count 35 transition count 39
Applied a total of 399 rules in 235 ms. Remains 35 /181 variables (removed 146) and now considering 39/2295 (removed 2256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 35/181 places, 39/2295 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
// Phase 1: matrix 39 rows 35 cols
[2024-05-29 15:16:53] [INFO ] Computed 8 invariants in 1 ms
[2024-05-29 15:16:53] [INFO ] State equation strengthened by 9 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/59 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/62 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/70 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/73 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/74 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/74 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/74 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 52 constraints, problems are : Problem set: 0 solved, 3 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 15:16:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
[2024-05-29 15:16:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/55 variables, 25/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 7/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/59 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/60 variables, 1/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/62 variables, 2/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/62 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/70 variables, 4/50 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/73 variables, 2/52 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/74 variables, 2/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/74 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/74 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 55 constraints, problems are : Problem set: 2 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 267ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 39/39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 35 transition count 26
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 22 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 21 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 21 transition count 23
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 51 place count 8 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 8 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 6 transition count 5
Applied a total of 60 rules in 4 ms. Remains 6 /35 variables (removed 29) and now considering 5/39 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 6/35 places, 5/39 transitions.
RANDOM walk for 40000 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5 states, properties seen :0
Probabilistic random walk after 10 steps, saw 5 distinct states, run finished after 10 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 5 states, properties seen :0
Exhaustive walk after 10 steps, saw 5 distinct states, run finished after 1 ms. (steps per millisecond=10 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 20 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' '!(G(F(p0)))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 180 transition count 2216
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 89 rules applied. Total rules applied 167 place count 102 transition count 2205
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 169 place count 101 transition count 2204
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 169 place count 101 transition count 2191
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 195 place count 88 transition count 2191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 86 transition count 2187
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 86 transition count 2187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 84 transition count 2183
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 84 transition count 2183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 84 transition count 2180
Performed 40 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 286 place count 44 transition count 2124
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 4 with 518 rules applied. Total rules applied 804 place count 44 transition count 1606
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 812 place count 40 transition count 1602
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 816 place count 40 transition count 1598
Drop transitions (Redundant composition of simpler transitions.) removed 1529 transitions
Redundant transition composition rules discarded 1529 transitions
Iterating global reduction 6 with 1529 rules applied. Total rules applied 2345 place count 40 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2365 place count 30 transition count 59
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 2366 place count 30 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2367 place count 30 transition count 58
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 2372 place count 25 transition count 53
Applied a total of 2372 rules in 639 ms. Remains 25 /181 variables (removed 156) and now considering 53/2295 (removed 2242) transitions.
[2024-05-29 15:16:55] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
// Phase 1: matrix 42 rows 25 cols
[2024-05-29 15:16:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 15:16:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-29 15:16:55] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:16:55] [INFO ] Invariant cache hit.
[2024-05-29 15:16:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 15:16:55] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-29 15:16:55] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-29 15:16:55] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:16:55] [INFO ] Invariant cache hit.
[2024-05-29 15:16:55] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 15:16:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 4 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 2 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:16:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:16:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 1/67 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 115 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:16:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/67 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 83/83 constraints]
After SMT, in 4999ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/181 places, 53/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5857 ms. Remains : 25/181 places, 53/2295 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 80 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 : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-29 15:17:01] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:01] [INFO ] Invariant cache hit.
[2024-05-29 15:17:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 15:17:01] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:01] [INFO ] Invariant cache hit.
[2024-05-29 15:17:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 15:17:01] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-29 15:17:01] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-29 15:17:01] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:01] [INFO ] Invariant cache hit.
[2024-05-29 15:17:01] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 1/67 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 115 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/67 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 83/83 constraints]
After SMT, in 4660ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4766 ms. Remains : 25/25 places, 53/53 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 77 ms.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 53/53 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-29 15:17:06] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:06] [INFO ] Invariant cache hit.
[2024-05-29 15:17:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 15:17:06] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:06] [INFO ] Invariant cache hit.
[2024-05-29 15:17:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 15:17:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-29 15:17:06] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-29 15:17:06] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2024-05-29 15:17:06] [INFO ] Invariant cache hit.
[2024-05-29 15:17:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 1/67 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 115 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:17:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 41/66 variables, 25/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/67 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/67 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 83/83 constraints]
After SMT, in 4921ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4922ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5016 ms. Remains : 25/25 places, 53/53 transitions.
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-00 finished in 17591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(F(p2))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 163 transition count 2274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 163 transition count 2274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 163 transition count 2270
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 150 transition count 2254
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 150 transition count 2254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 150 transition count 2253
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 140 transition count 2243
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 140 transition count 2243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 140 transition count 2242
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 134 transition count 2236
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 134 transition count 2236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 134 transition count 2234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 132 transition count 2232
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 132 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 131 transition count 2231
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 131 transition count 2231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 131 transition count 2230
Applied a total of 109 rules in 60 ms. Remains 131 /181 variables (removed 50) and now considering 2230/2295 (removed 65) transitions.
[2024-05-29 15:17:12] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
// Phase 1: matrix 2219 rows 131 cols
[2024-05-29 15:17:12] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 15:17:12] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-29 15:17:12] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-29 15:17:12] [INFO ] Invariant cache hit.
[2024-05-29 15:17:13] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:17:13] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
Running 2229 sub problems to find dead transitions.
[2024-05-29 15:17:13] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-29 15:17:13] [INFO ] Invariant cache hit.
[2024-05-29 15:17:14] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:17:59] [INFO ] Deduced a trap composed of 13 places in 626 ms of which 1 ms to minimize.
[2024-05-29 15:18:00] [INFO ] Deduced a trap composed of 13 places in 616 ms of which 0 ms to minimize.
[2024-05-29 15:18:00] [INFO ] Deduced a trap composed of 13 places in 591 ms of which 1 ms to minimize.
[2024-05-29 15:18:01] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:18:01] [INFO ] Deduced a trap composed of 13 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:18:02] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 0 ms to minimize.
[2024-05-29 15:18:03] [INFO ] Deduced a trap composed of 13 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:18:03] [INFO ] Deduced a trap composed of 15 places in 609 ms of which 0 ms to minimize.
[2024-05-29 15:18:04] [INFO ] Deduced a trap composed of 13 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:18:04] [INFO ] Deduced a trap composed of 13 places in 580 ms of which 1 ms to minimize.
[2024-05-29 15:18:05] [INFO ] Deduced a trap composed of 15 places in 591 ms of which 1 ms to minimize.
[2024-05-29 15:18:06] [INFO ] Deduced a trap composed of 15 places in 562 ms of which 1 ms to minimize.
[2024-05-29 15:18:06] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:18:07] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:18:07] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:18:07] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2024-05-29 15:18:08] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2024-05-29 15:18:08] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 1 ms to minimize.
[2024-05-29 15:18:09] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2024-05-29 15:18:09] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:18:10] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2024-05-29 15:18:10] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 0 ms to minimize.
[2024-05-29 15:18:10] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 0 ms to minimize.
[2024-05-29 15:18:10] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:18:11] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2024-05-29 15:18:11] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 0 ms to minimize.
[2024-05-29 15:18:11] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2024-05-29 15:18:11] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2024-05-29 15:18:12] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2024-05-29 15:18:12] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2024-05-29 15:18:13] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 0 ms to minimize.
[2024-05-29 15:18:13] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 15:18:13] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:18:13] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:18:14] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:18:14] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:18:14] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:18:14] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 0 ms to minimize.
[2024-05-29 15:18:15] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 1 ms to minimize.
[2024-05-29 15:18:15] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
SMT process timed out in 61875ms, After SMT, problems are : Problem set: 0 solved, 2229 unsolved
Search for dead transitions found 0 dead transitions in 61901ms
Starting structural reductions in LTL mode, iteration 1 : 131/181 places, 2230/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63886 ms. Remains : 131/181 places, 2230/2295 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-03
Product exploration explored 100000 steps with 2620 reset in 503 ms.
Product exploration explored 100000 steps with 2657 reset in 479 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9 resets) in 4577 ms. (8 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2024-05-29 15:18:18] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
[2024-05-29 15:18:18] [INFO ] Invariant cache hit.
[2024-05-29 15:18:18] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 15:18:19] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 1 ms to minimize.
[2024-05-29 15:18:20] [INFO ] Deduced a trap composed of 13 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:18:20] [INFO ] Deduced a trap composed of 13 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:18:21] [INFO ] Deduced a trap composed of 13 places in 535 ms of which 1 ms to minimize.
[2024-05-29 15:18:21] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 1 ms to minimize.
[2024-05-29 15:18:22] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 0 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 13 places in 514 ms of which 1 ms to minimize.
[2024-05-29 15:18:23] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 1 ms to minimize.
[2024-05-29 15:18:24] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
SMT process timed out in 5292ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2230/2230 transitions.
Graph (complete) has 471 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 130 transition count 2165
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 87 transition count 2143
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 142 place count 76 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 76 transition count 2141
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 144 place count 75 transition count 2141
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 65 transition count 2131
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 65 transition count 2131
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 174 place count 55 transition count 2121
Iterating global reduction 3 with 10 rules applied. Total rules applied 184 place count 55 transition count 2121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 55 transition count 2120
Performed 38 Post agglomeration using F-continuation condition with reduction of 2040 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 267 place count 11 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 298 place count 11 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 301 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 302 place count 9 transition count 8
Applied a total of 302 rules in 123 ms. Remains 9 /131 variables (removed 122) and now considering 8/2230 (removed 2222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 9/131 places, 8/2230 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 9 cols
[2024-05-29 15:18:24] [INFO ] Computed 3 invariants in 0 ms
[2024-05-29 15:18:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 15:18:24] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 17/17 variables, and 15 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 14 factoid took 314 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-29 15:18:25] [INFO ] Flow matrix only has 2219 transitions (discarded 11 similar events)
// Phase 1: matrix 2219 rows 131 cols
[2024-05-29 15:18:25] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 15:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:18:25] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2024-05-29 15:18:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:18:26] [INFO ] [Real]Added 2055 Read/Feed constraints in 184 ms returned sat
[2024-05-29 15:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:18:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:18:27] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-29 15:18:27] [INFO ] [Nat]Added 2055 Read/Feed constraints in 217 ms returned sat
[2024-05-29 15:18:28] [INFO ] Computed and/alt/rep : 141/173/141 causal constraints (skipped 2077 transitions) in 598 ms.
[2024-05-29 15:18:30] [INFO ] Added : 97 causal constraints over 20 iterations in 2511 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2230/2230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 130 transition count 2196
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 35 rules applied. Total rules applied 68 place count 97 transition count 2194
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 70 place count 96 transition count 2193
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 96 transition count 2182
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 85 transition count 2182
Performed 39 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 170 place count 46 transition count 2135
Ensure Unique test removed 1033 transitions
Reduce isomorphic transitions removed 1033 transitions.
Iterating post reduction 3 with 1033 rules applied. Total rules applied 1203 place count 46 transition count 1102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 1219 place count 38 transition count 1094
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1227 place count 38 transition count 1086
Drop transitions (Redundant composition of simpler transitions.) removed 1033 transitions
Redundant transition composition rules discarded 1033 transitions
Iterating global reduction 5 with 1033 rules applied. Total rules applied 2260 place count 38 transition count 53
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2280 place count 28 transition count 43
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2284 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2285 place count 28 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2286 place count 27 transition count 41
Applied a total of 2286 rules in 469 ms. Remains 27 /131 variables (removed 104) and now considering 41/2230 (removed 2189) transitions.
[2024-05-29 15:18:30] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
// Phase 1: matrix 30 rows 27 cols
[2024-05-29 15:18:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 15:18:31] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-29 15:18:31] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
[2024-05-29 15:18:31] [INFO ] Invariant cache hit.
[2024-05-29 15:18:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:18:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-29 15:18:31] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-29 15:18:31] [INFO ] Flow matrix only has 30 transitions (discarded 11 similar events)
[2024-05-29 15:18:31] [INFO ] Invariant cache hit.
[2024-05-29 15:18:31] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 16 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, 40 unsolved
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:18:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [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, 20/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 1/57 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (OVERLAPS) 0/57 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 108 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 15:18:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 29/56 variables, 27/107 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 1/57 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/57 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/57 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 159 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 79/79 constraints]
After SMT, in 3715ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3716ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/131 places, 41/2230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4456 ms. Remains : 27/131 places, 41/2230 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 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 14 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-09a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-03 finished in 82956 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(p1))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 2275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 2275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 164 transition count 2271
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 152 transition count 2256
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 152 transition count 2256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 152 transition count 2255
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 142 transition count 2245
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 142 transition count 2245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 142 transition count 2244
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 136 transition count 2238
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 136 transition count 2238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 136 transition count 2236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 133 transition count 2233
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 133 transition count 2233
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 132 transition count 2232
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 132 transition count 2232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 132 transition count 2231
Applied a total of 107 rules in 65 ms. Remains 132 /181 variables (removed 49) and now considering 2231/2295 (removed 64) transitions.
[2024-05-29 15:18:34] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
// Phase 1: matrix 2220 rows 132 cols
[2024-05-29 15:18:34] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 15:18:35] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-29 15:18:35] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-29 15:18:35] [INFO ] Invariant cache hit.
[2024-05-29 15:18:35] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:18:36] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
Running 2230 sub problems to find dead transitions.
[2024-05-29 15:18:36] [INFO ] Flow matrix only has 2220 transitions (discarded 11 similar events)
[2024-05-29 15:18:36] [INFO ] Invariant cache hit.
[2024-05-29 15:18:36] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:19:22] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2024-05-29 15:19:22] [INFO ] Deduced a trap composed of 13 places in 509 ms of which 1 ms to minimize.
[2024-05-29 15:19:23] [INFO ] Deduced a trap composed of 13 places in 532 ms of which 0 ms to minimize.
[2024-05-29 15:19:23] [INFO ] Deduced a trap composed of 13 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 13 places in 641 ms of which 1 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 13 places in 618 ms of which 1 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:19:26] [INFO ] Deduced a trap composed of 15 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:19:26] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:19:27] [INFO ] Deduced a trap composed of 14 places in 522 ms of which 1 ms to minimize.
[2024-05-29 15:19:27] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:19:28] [INFO ] Deduced a trap composed of 17 places in 515 ms of which 1 ms to minimize.
[2024-05-29 15:19:28] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 13 places in 514 ms of which 1 ms to minimize.
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 0 ms to minimize.
[2024-05-29 15:19:30] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2024-05-29 15:19:30] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:19:31] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2024-05-29 15:19:31] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:19:31] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:19:32] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2024-05-29 15:19:33] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 0 ms to minimize.
[2024-05-29 15:19:33] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:19:33] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:19:33] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 0 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/2352 variables, and 41 constraints, problems are : Problem set: 0 solved, 2230 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/132 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2230/173 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:19:46] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2024-05-29 15:19:47] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 1 ms to minimize.
[2024-05-29 15:19:47] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2024-05-29 15:19:47] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:19:47] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 0 ms to minimize.
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2024-05-29 15:19:49] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 15:19:50] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 15:19:51] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 0 ms to minimize.
[2024-05-29 15:19:51] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 15:19:51] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 15:19:51] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:19:52] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 0 ms to minimize.
[2024-05-29 15:19:52] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-05-29 15:19:52] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:19:52] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-29 15:19:53] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:19:54] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-05-29 15:19:54] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2024-05-29 15:19:54] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:19:54] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 15:19:54] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:19:55] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2024-05-29 15:19:55] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 15:19:55] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 15:19:56] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:19:56] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 15:19:58] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:19:59] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:20:00] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:20:00] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:20:00] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2024-05-29 15:20:00] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 15:20:00] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 15:20:01] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:20:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2230 unsolved
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:20:06] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:20:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:20:06] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:20:07] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2024-05-29 15:20:07] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:20:07] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:20:07] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 15:20:08] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:20:08] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:20:08] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/2352 variables, and 115 constraints, problems are : Problem set: 0 solved, 2230 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/132 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/173 constraints, Known Traps: 114/114 constraints]
After SMT, in 91804ms problems are : Problem set: 0 solved, 2230 unsolved
Search for dead transitions found 0 dead transitions in 91831ms
Starting structural reductions in LTL mode, iteration 1 : 132/181 places, 2231/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93755 ms. Remains : 132/181 places, 2231/2295 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-04 finished in 93927 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) U X(p1))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 163 transition count 2275
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 163 transition count 2275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 163 transition count 2270
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 151 transition count 2256
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 151 transition count 2256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 151 transition count 2255
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 142 transition count 2246
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 142 transition count 2246
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 135 transition count 2239
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 135 transition count 2239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 135 transition count 2237
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 131 transition count 2233
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 131 transition count 2233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 131 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 130 transition count 2231
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 130 transition count 2231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 130 transition count 2230
Applied a total of 112 rules in 63 ms. Remains 130 /181 variables (removed 51) and now considering 2230/2295 (removed 65) transitions.
[2024-05-29 15:20:08] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
// Phase 1: matrix 2218 rows 130 cols
[2024-05-29 15:20:08] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 15:20:09] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-29 15:20:09] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
[2024-05-29 15:20:09] [INFO ] Invariant cache hit.
[2024-05-29 15:20:10] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:20:10] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Running 2229 sub problems to find dead transitions.
[2024-05-29 15:20:10] [INFO ] Flow matrix only has 2218 transitions (discarded 12 similar events)
[2024-05-29 15:20:10] [INFO ] Invariant cache hit.
[2024-05-29 15:20:10] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:20:55] [INFO ] Deduced a trap composed of 13 places in 501 ms of which 1 ms to minimize.
[2024-05-29 15:20:56] [INFO ] Deduced a trap composed of 13 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:20:56] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 1 ms to minimize.
[2024-05-29 15:20:57] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 0 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 13 places in 435 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 15 places in 414 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 18 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:21:00] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2024-05-29 15:21:00] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:21:00] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 0 ms to minimize.
[2024-05-29 15:21:01] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2024-05-29 15:21:01] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2024-05-29 15:21:02] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:21:02] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 0 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 0 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 0 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 15:21:04] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:21:04] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:21:06] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:21:06] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:21:06] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 0 ms to minimize.
[2024-05-29 15:21:06] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 0 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 15:21:08] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2024-05-29 15:21:08] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 1 ms to minimize.
[2024-05-29 15:21:09] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/2348 variables, and 41 constraints, problems are : Problem set: 0 solved, 2229 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/130 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2229/172 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2024-05-29 15:21:20] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2024-05-29 15:21:21] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 0 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2024-05-29 15:21:22] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2024-05-29 15:21:23] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2024-05-29 15:21:24] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:21:24] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:21:24] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 0 ms to minimize.
[2024-05-29 15:21:24] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 1 ms to minimize.
[2024-05-29 15:21:25] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:21:26] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:21:26] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:21:26] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 0 ms to minimize.
[2024-05-29 15:21:26] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 0 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2024-05-29 15:21:27] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 1 ms to minimize.
[2024-05-29 15:21:28] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 0 ms to minimize.
[2024-05-29 15:21:28] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 0 ms to minimize.
[2024-05-29 15:21:28] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 0 ms to minimize.
[2024-05-29 15:21:28] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 15:21:29] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 0 ms to minimize.
[2024-05-29 15:21:29] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 0 ms to minimize.
[2024-05-29 15:21:30] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2024-05-29 15:21:30] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2024-05-29 15:21:30] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2024-05-29 15:21:30] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:21:31] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2024-05-29 15:21:31] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:21:31] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:21:31] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:21:32] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 15:21:32] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2024-05-29 15:21:32] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 15:21:32] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:21:32] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:21:33] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-05-29 15:21:33] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 0 ms to minimize.
[2024-05-29 15:21:33] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:21:34] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:21:35] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:21:35] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2229 unsolved
[2024-05-29 15:21:37] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:21:37] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:21:37] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:21:37] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 15:21:38] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:21:38] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:21:38] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:21:39] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 0 ms to minimize.
[2024-05-29 15:21:39] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 1 ms to minimize.
[2024-05-29 15:21:39] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:21:41] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:21:42] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/2348 variables, and 116 constraints, problems are : Problem set: 0 solved, 2229 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/130 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/172 constraints, Known Traps: 115/115 constraints]
After SMT, in 91247ms problems are : Problem set: 0 solved, 2229 unsolved
Search for dead transitions found 0 dead transitions in 91272ms
Starting structural reductions in LTL mode, iteration 1 : 130/181 places, 2230/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93299 ms. Remains : 130/181 places, 2230/2295 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-09a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-05 finished in 94002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(!p0)||(!p1&&G(p2)))))||(p1&&F((G(!p0)||(!p1&&G(p2))))))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 180 transition count 2223
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 79 rules applied. Total rules applied 150 place count 109 transition count 2215
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 153 place count 108 transition count 2213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 107 transition count 2213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 154 place count 107 transition count 2200
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 180 place count 94 transition count 2200
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 92 transition count 2196
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 92 transition count 2196
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 90 transition count 2192
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 90 transition count 2192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 191 place count 90 transition count 2189
Performed 40 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 271 place count 50 transition count 2133
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 5 with 518 rules applied. Total rules applied 789 place count 50 transition count 1615
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 797 place count 46 transition count 1611
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 801 place count 46 transition count 1607
Drop transitions (Redundant composition of simpler transitions.) removed 1497 transitions
Redundant transition composition rules discarded 1497 transitions
Iterating global reduction 7 with 1497 rules applied. Total rules applied 2298 place count 46 transition count 110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2318 place count 36 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2319 place count 36 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2320 place count 36 transition count 99
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2325 place count 31 transition count 94
Applied a total of 2325 rules in 379 ms. Remains 31 /181 variables (removed 150) and now considering 94/2295 (removed 2201) transitions.
[2024-05-29 15:21:43] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
// Phase 1: matrix 83 rows 31 cols
[2024-05-29 15:21:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 15:21:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 15:21:43] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:43] [INFO ] Invariant cache hit.
[2024-05-29 15:21:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:21:43] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 15:21:43] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-29 15:21:43] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:43] [INFO ] Invariant cache hit.
[2024-05-29 15:21:43] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:21:46] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 82/113 variables, 31/105 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 1/114 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 117 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 82/113 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 93/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 219 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5372 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 82/82 constraints]
After SMT, in 9966ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9968ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/181 places, 94/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10500 ms. Remains : 31/181 places, 94/2295 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 104 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 p1 p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 142 ms. Reduced automaton from 5 states, 23 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), false, false]
RANDOM walk for 40000 steps (918 resets) in 297 ms. (134 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (63 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2024-05-29 15:21:54] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:54] [INFO ] Invariant cache hit.
[2024-05-29 15:21:54] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/113 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 44 constraints, problems are : Problem set: 0 solved, 2 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:21:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 31/114 variables, and 52 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 51/51 constraints]
After SMT, in 1709ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (G (OR p2 p0)), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (NOT (AND (OR (NOT p1) p0) (OR p2 p0))))]
Knowledge based reduction with 33 factoid took 465 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
[2024-05-29 15:21:57] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:57] [INFO ] Invariant cache hit.
[2024-05-29 15:21:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 15:21:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 15:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:21:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:21:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-29 15:21:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:21:57] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-29 15:21:57] [INFO ] Computed and/alt/rep : 71/195/71 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-29 15:21:57] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-29 15:21:57] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:57] [INFO ] Invariant cache hit.
[2024-05-29 15:21:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 15:21:57] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:57] [INFO ] Invariant cache hit.
[2024-05-29 15:21:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:21:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-29 15:21:57] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-29 15:21:57] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:21:57] [INFO ] Invariant cache hit.
[2024-05-29 15:21:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 82/113 variables, 31/105 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 1/114 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 117 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 15:22:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 82/113 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 93/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 219 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 82/82 constraints]
After SMT, in 9632ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9633ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9749 ms. Remains : 31/31 places, 94/94 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 p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X p0), (X (NOT (OR (AND p1 p0) (NOT p2)))), (X (NOT p1)), (X (AND p2 p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (OR (AND p1 p0) (NOT p2)))), (X (X p1)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 139 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
RANDOM walk for 40000 steps (908 resets) in 177 ms. (224 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (74 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-29 15:22:07] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:22:07] [INFO ] Invariant cache hit.
[2024-05-29 15:22:07] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/113 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 44 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 113/114 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 32/32 constraints]
After SMT, in 1088ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X p0), (X (NOT (OR (AND p1 p0) (NOT p2)))), (X (NOT p1)), (X (AND p2 p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X (OR (AND p1 p0) (NOT p2)))), (X (X p1)), (X (X (AND p2 p0))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 443 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
[2024-05-29 15:22:09] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:22:09] [INFO ] Invariant cache hit.
[2024-05-29 15:22:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 15:22:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 15:22:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 15:22:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 15:22:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-29 15:22:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:22:09] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-29 15:22:09] [INFO ] Computed and/alt/rep : 71/195/71 causal constraints (skipped 11 transitions) in 4 ms.
[2024-05-29 15:22:09] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p2), false]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-29 15:22:09] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:22:09] [INFO ] Invariant cache hit.
[2024-05-29 15:22:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 15:22:09] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:22:09] [INFO ] Invariant cache hit.
[2024-05-29 15:22:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 15:22:09] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-29 15:22:09] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-29 15:22:09] [INFO ] Flow matrix only has 83 transitions (discarded 11 similar events)
[2024-05-29 15:22:09] [INFO ] Invariant cache hit.
[2024-05-29 15:22:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 15:22:12] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 82/113 variables, 31/105 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 1/114 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/114 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 117 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 15:22:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 82/113 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 93/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/114 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 219 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 82/82 constraints]
After SMT, in 9973ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9974ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10087 ms. Remains : 31/31 places, 94/94 transitions.
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-09 finished in 37133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 2273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 2273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 162 transition count 2268
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 149 transition count 2252
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 149 transition count 2252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 149 transition count 2251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 139 transition count 2241
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 139 transition count 2241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 139 transition count 2240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 133 transition count 2234
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 133 transition count 2234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 133 transition count 2233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 129 transition count 2229
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 129 transition count 2229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 129 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 128 transition count 2227
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 128 transition count 2227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 128 transition count 2226
Applied a total of 116 rules in 64 ms. Remains 128 /181 variables (removed 53) and now considering 2226/2295 (removed 69) transitions.
[2024-05-29 15:22:20] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
// Phase 1: matrix 2215 rows 128 cols
[2024-05-29 15:22:20] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 15:22:20] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-29 15:22:20] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:22:20] [INFO ] Invariant cache hit.
[2024-05-29 15:22:21] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:22:21] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2024-05-29 15:22:21] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
[2024-05-29 15:22:21] [INFO ] Invariant cache hit.
[2024-05-29 15:22:21] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:06] [INFO ] Deduced a trap composed of 13 places in 519 ms of which 0 ms to minimize.
[2024-05-29 15:23:06] [INFO ] Deduced a trap composed of 15 places in 503 ms of which 1 ms to minimize.
[2024-05-29 15:23:07] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:23:07] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 0 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 13 places in 521 ms of which 1 ms to minimize.
[2024-05-29 15:23:08] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 0 ms to minimize.
[2024-05-29 15:23:09] [INFO ] Deduced a trap composed of 13 places in 507 ms of which 1 ms to minimize.
[2024-05-29 15:23:09] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 0 ms to minimize.
[2024-05-29 15:23:10] [INFO ] Deduced a trap composed of 13 places in 514 ms of which 1 ms to minimize.
[2024-05-29 15:23:11] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 0 ms to minimize.
[2024-05-29 15:23:11] [INFO ] Deduced a trap composed of 15 places in 629 ms of which 1 ms to minimize.
[2024-05-29 15:23:12] [INFO ] Deduced a trap composed of 14 places in 638 ms of which 1 ms to minimize.
[2024-05-29 15:23:12] [INFO ] Deduced a trap composed of 14 places in 524 ms of which 1 ms to minimize.
[2024-05-29 15:23:13] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 1 ms to minimize.
[2024-05-29 15:23:13] [INFO ] Deduced a trap composed of 13 places in 444 ms of which 1 ms to minimize.
[2024-05-29 15:23:14] [INFO ] Deduced a trap composed of 14 places in 442 ms of which 0 ms to minimize.
[2024-05-29 15:23:14] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 0 ms to minimize.
[2024-05-29 15:23:15] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2024-05-29 15:23:15] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 1 ms to minimize.
[2024-05-29 15:23:16] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:16] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2024-05-29 15:23:16] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-05-29 15:23:17] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 15:23:17] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:23:17] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
[2024-05-29 15:23:17] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:23:18] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2024-05-29 15:23:18] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:23:18] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:23:18] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:23:18] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2024-05-29 15:23:19] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:23:19] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2024-05-29 15:23:19] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2024-05-29 15:23:19] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2024-05-29 15:23:20] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:23:20] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 1 ms to minimize.
[2024-05-29 15:23:21] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:23:21] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:23:22] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/2343 variables, and 41 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/128 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2225/168 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:31] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 15:23:31] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 0 ms to minimize.
[2024-05-29 15:23:31] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-05-29 15:23:31] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:23:32] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:23:32] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2024-05-29 15:23:32] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:23:32] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 15:23:32] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 0 ms to minimize.
[2024-05-29 15:23:33] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 0 ms to minimize.
[2024-05-29 15:23:33] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:23:33] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:23:33] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2024-05-29 15:23:33] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:23:34] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 0 ms to minimize.
[2024-05-29 15:23:34] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2024-05-29 15:23:34] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 15:23:34] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
[2024-05-29 15:23:34] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:23:35] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:36] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2024-05-29 15:23:36] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:23:36] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:23:36] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:23:36] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2024-05-29 15:23:37] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:23:37] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
[2024-05-29 15:23:37] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:23:37] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:23:38] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:23:38] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:23:38] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:23:38] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:23:38] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2024-05-29 15:23:39] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:23:39] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 15:23:39] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:23:39] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:23:39] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:23:40] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:41] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:23:42] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2024-05-29 15:23:43] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:23:43] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2024-05-29 15:23:43] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:23:43] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:23:43] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:23:44] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:23:49] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 0 ms to minimize.
[2024-05-29 15:23:49] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2024-05-29 15:23:49] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 1 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 0 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:23:50] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:23:51] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:23:51] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:23:51] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:23:51] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:23:52] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:23:53] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/2343 variables, and 121 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/128 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/168 constraints, Known Traps: 120/120 constraints]
After SMT, in 91477ms problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 91499ms
Starting structural reductions in LTL mode, iteration 1 : 128/181 places, 2226/2295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93378 ms. Remains : 128/181 places, 2226/2295 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-10 finished in 93574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 2295/2295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 180 transition count 2216
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 89 rules applied. Total rules applied 167 place count 102 transition count 2205
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 169 place count 101 transition count 2204
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 169 place count 101 transition count 2191
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 195 place count 88 transition count 2191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 85 transition count 2185
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 85 transition count 2185
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 82 transition count 2179
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 82 transition count 2179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 214 place count 82 transition count 2172
Performed 39 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 292 place count 43 transition count 2120
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 4 with 1027 rules applied. Total rules applied 1319 place count 43 transition count 1093
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1327 place count 39 transition count 1089
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1331 place count 39 transition count 1085
Drop transitions (Redundant composition of simpler transitions.) removed 1033 transitions
Redundant transition composition rules discarded 1033 transitions
Iterating global reduction 6 with 1033 rules applied. Total rules applied 2364 place count 39 transition count 52
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2384 place count 29 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2386 place count 29 transition count 42
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2392 place count 23 transition count 36
Applied a total of 2392 rules in 230 ms. Remains 23 /181 variables (removed 158) and now considering 36/2295 (removed 2259) transitions.
[2024-05-29 15:23:53] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-29 15:23:53] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 15:23:54] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 15:23:54] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2024-05-29 15:23:54] [INFO ] Invariant cache hit.
[2024-05-29 15:23:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-29 15:23:54] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 15:23:54] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
[2024-05-29 15:23:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/47 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:23:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 4 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 89 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 15:23:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 24/47 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 15:23:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 138 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 91/91 constraints]
After SMT, in 2771ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 2771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/181 places, 36/2295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3335 ms. Remains : 23/181 places, 36/2295 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLCardinality-11 finished in 3437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(!p0)||(!p1&&G(p2)))))||(p1&&F((G(!p0)||(!p1&&G(p2))))))))'
[2024-05-29 15:23:57] [INFO ] Flatten gal took : 150 ms
[2024-05-29 15:23:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 15:23:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 2295 transitions and 41625 arcs took 44 ms.
Total runtime 444963 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-09a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 181
TRANSITIONS: 2295
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.174s, Sys 0.021s]


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


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

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

Process ID: 4786
MODEL NAME: /home/mcc/execution/411/model
181 places, 2295 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-09a-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-09a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716996289351

--------------------
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

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-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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