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-171690530100307.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 StigmergyElection-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 428K 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 StigmergyElection-PT-05b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717010040060

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:14:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:14:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:14:01] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-29 19:14:01] [INFO ] Transformed 699 places.
[2024-05-29 19:14:01] [INFO ] Transformed 1266 transitions.
[2024-05-29 19:14:01] [INFO ] Found NUPN structural information;
[2024-05-29 19:14:01] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-05b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 618 transition count 1185
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 618 transition count 1185
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 202 place count 578 transition count 1145
Iterating global reduction 0 with 40 rules applied. Total rules applied 242 place count 578 transition count 1145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 247 place count 573 transition count 1140
Iterating global reduction 0 with 5 rules applied. Total rules applied 252 place count 573 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 254 place count 571 transition count 1138
Iterating global reduction 0 with 2 rules applied. Total rules applied 256 place count 571 transition count 1138
Applied a total of 256 rules in 212 ms. Remains 571 /699 variables (removed 128) and now considering 1138/1266 (removed 128) transitions.
// Phase 1: matrix 1138 rows 571 cols
[2024-05-29 19:14:02] [INFO ] Computed 6 invariants in 49 ms
[2024-05-29 19:14:02] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 19:14:02] [INFO ] Invariant cache hit.
[2024-05-29 19:14:02] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Running 1137 sub problems to find dead transitions.
[2024-05-29 19:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 1 (OVERLAPS) 1/571 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
[2024-05-29 19:14:25] [INFO ] Deduced a trap composed of 168 places in 323 ms of which 29 ms to minimize.
[2024-05-29 19:14:25] [INFO ] Deduced a trap composed of 167 places in 312 ms of which 4 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 172 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:14:28] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:14:28] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 2 ms to minimize.
[2024-05-29 19:14:29] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:14:29] [INFO ] Deduced a trap composed of 169 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:14:29] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:14:30] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:14:30] [INFO ] Deduced a trap composed of 169 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:14:31] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 2 ms to minimize.
[2024-05-29 19:14:31] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 2 ms to minimize.
[2024-05-29 19:14:33] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1709 variables, and 22 constraints, problems are : Problem set: 0 solved, 1137 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/571 constraints, PredecessorRefiner: 1137/1137 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 1 (OVERLAPS) 1/571 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
[2024-05-29 19:14:47] [INFO ] Deduced a trap composed of 165 places in 309 ms of which 4 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 170 places in 236 ms of which 3 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:14:53] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:14:53] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 3 ms to minimize.
[2024-05-29 19:14:53] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:14:54] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:14:54] [INFO ] Deduced a trap composed of 173 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:14:54] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 3 ms to minimize.
[2024-05-29 19:14:55] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:14:56] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:14:57] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:14:57] [INFO ] Deduced a trap composed of 169 places in 236 ms of which 3 ms to minimize.
[2024-05-29 19:14:57] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 3 ms to minimize.
[2024-05-29 19:14:57] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-05-29 19:14:58] [INFO ] Deduced a trap composed of 168 places in 250 ms of which 2 ms to minimize.
[2024-05-29 19:14:58] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:14:59] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 4 ms to minimize.
[2024-05-29 19:14:59] [INFO ] Deduced a trap composed of 172 places in 273 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1137 unsolved
[2024-05-29 19:15:02] [INFO ] Deduced a trap composed of 221 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1709 variables, and 43 constraints, problems are : Problem set: 0 solved, 1137 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/571 constraints, PredecessorRefiner: 0/1137 constraints, Known Traps: 37/37 constraints]
After SMT, in 62555ms problems are : Problem set: 0 solved, 1137 unsolved
Search for dead transitions found 0 dead transitions in 62590ms
Starting structural reductions in LTL mode, iteration 1 : 571/699 places, 1138/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63823 ms. Remains : 571/699 places, 1138/1266 transitions.
Support contains 27 out of 571 places after structural reductions.
[2024-05-29 19:15:05] [INFO ] Flatten gal took : 157 ms
[2024-05-29 19:15:06] [INFO ] Flatten gal took : 87 ms
[2024-05-29 19:15:06] [INFO ] Input system was already deterministic with 1138 transitions.
Support contains 25 out of 571 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 40000 steps (448 resets) in 1849 ms. (21 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (79 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (78 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (78 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (76 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (78 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (81 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (78 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (78 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
[2024-05-29 19:15:07] [INFO ] Invariant cache hit.
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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 541/557 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 14/571 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1138/1709 variables, 571/577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1709 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1709 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 577 constraints, problems are : Problem set: 0 solved, 9 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 571/571 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 541/557 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:15:08] [INFO ] Deduced a trap composed of 168 places in 303 ms of which 4 ms to minimize.
[2024-05-29 19:15:08] [INFO ] Deduced a trap composed of 166 places in 303 ms of which 3 ms to minimize.
[2024-05-29 19:15:09] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 4 ms to minimize.
[2024-05-29 19:15:09] [INFO ] Deduced a trap composed of 169 places in 281 ms of which 3 ms to minimize.
[2024-05-29 19:15:09] [INFO ] Deduced a trap composed of 169 places in 314 ms of which 3 ms to minimize.
[2024-05-29 19:15:10] [INFO ] Deduced a trap composed of 169 places in 429 ms of which 3 ms to minimize.
[2024-05-29 19:15:10] [INFO ] Deduced a trap composed of 168 places in 434 ms of which 7 ms to minimize.
[2024-05-29 19:15:10] [INFO ] Deduced a trap composed of 219 places in 360 ms of which 3 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 169 places in 433 ms of which 3 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 3 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 3 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 220 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 220 places in 235 ms of which 5 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 3 ms to minimize.
SMT process timed out in 5924ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Graph (trivial) has 556 edges and 571 vertex of which 75 / 571 are part of one of the 13 SCC in 4 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 1075 edges and 509 vertex of which 505 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 341 rules applied. Total rules applied 343 place count 505 transition count 714
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 350 rules applied. Total rules applied 693 place count 168 transition count 701
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 704 place count 161 transition count 697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 708 place count 157 transition count 697
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 708 place count 157 transition count 674
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 754 place count 134 transition count 674
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 757 place count 131 transition count 670
Iterating global reduction 4 with 3 rules applied. Total rules applied 760 place count 131 transition count 670
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 4 with 1 rules applied. Total rules applied 761 place count 131 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 762 place count 130 transition count 669
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 762 place count 130 transition count 668
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 764 place count 129 transition count 668
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 765 place count 128 transition count 666
Iterating global reduction 6 with 1 rules applied. Total rules applied 766 place count 128 transition count 666
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 808 place count 107 transition count 645
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 813 place count 107 transition count 640
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 826 place count 94 transition count 222
Iterating global reduction 7 with 13 rules applied. Total rules applied 839 place count 94 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 848 place count 94 transition count 213
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 8 with 16 rules applied. Total rules applied 864 place count 86 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 874 place count 81 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 875 place count 81 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 884 place count 81 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 886 place count 80 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 894 place count 80 transition count 201
Free-agglomeration rule applied 27 times.
Iterating global reduction 9 with 27 rules applied. Total rules applied 921 place count 80 transition count 174
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 949 place count 53 transition count 173
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 953 place count 49 transition count 169
Iterating global reduction 10 with 4 rules applied. Total rules applied 957 place count 49 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 960 place count 49 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 963 place count 49 transition count 166
Applied a total of 963 rules in 203 ms. Remains 49 /571 variables (removed 522) and now considering 166/1138 (removed 972) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 49/571 places, 166/1138 transitions.
RANDOM walk for 17517 steps (4 resets) in 290 ms. (60 steps per ms) remains 0/9 properties
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&G(p1))))))'
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 65 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:15:13] [INFO ] Computed 6 invariants in 11 ms
[2024-05-29 19:15:14] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-29 19:15:14] [INFO ] Invariant cache hit.
[2024-05-29 19:15:14] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:15:37] [INFO ] Deduced a trap composed of 164 places in 312 ms of which 3 ms to minimize.
[2024-05-29 19:15:37] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:15:37] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 163 places in 279 ms of which 5 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 3 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 2 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 163 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 2 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 2 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-05-29 19:15:42] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:15:42] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 2 ms to minimize.
[2024-05-29 19:15:43] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:15:44] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:15:44] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 2 ms to minimize.
[2024-05-29 19:15:44] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 2 ms to minimize.
[2024-05-29 19:15:46] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 3 ms to minimize.
[2024-05-29 19:15:46] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:15:58] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:16:01] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:16:01] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:16:02] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:16:03] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2024-05-29 19:16:04] [INFO ] Deduced a trap composed of 167 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:16:05] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 3 ms to minimize.
[2024-05-29 19:16:06] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:16:06] [INFO ] Deduced a trap composed of 167 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:16:06] [INFO ] Deduced a trap composed of 166 places in 283 ms of which 3 ms to minimize.
[2024-05-29 19:16:07] [INFO ] Deduced a trap composed of 167 places in 270 ms of which 2 ms to minimize.
[2024-05-29 19:16:07] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 3 ms to minimize.
[2024-05-29 19:16:07] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 4 ms to minimize.
[2024-05-29 19:16:08] [INFO ] Deduced a trap composed of 167 places in 294 ms of which 3 ms to minimize.
[2024-05-29 19:16:08] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:16:08] [INFO ] Deduced a trap composed of 203 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:16:09] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 3 ms to minimize.
[2024-05-29 19:16:09] [INFO ] Deduced a trap composed of 167 places in 246 ms of which 2 ms to minimize.
[2024-05-29 19:16:09] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62271ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62283ms
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63355 ms. Remains : 549/571 places, 1116/1138 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-00
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-00 finished in 63837 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(p0)||(p1&&G(p2))))||F(p3)))'
Support contains 6 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 562 transition count 1129
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 562 transition count 1129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 558 transition count 1125
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 558 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 557 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 557 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 556 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 556 transition count 1123
Applied a total of 30 rules in 55 ms. Remains 556 /571 variables (removed 15) and now considering 1123/1138 (removed 15) transitions.
// Phase 1: matrix 1123 rows 556 cols
[2024-05-29 19:16:17] [INFO ] Computed 6 invariants in 18 ms
[2024-05-29 19:16:17] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-29 19:16:17] [INFO ] Invariant cache hit.
[2024-05-29 19:16:18] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2024-05-29 19:16:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (OVERLAPS) 1/556 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 19:16:38] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 3 ms to minimize.
[2024-05-29 19:16:38] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:16:38] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 2 ms to minimize.
[2024-05-29 19:16:38] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 3 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 165 places in 283 ms of which 3 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:16:42] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:16:42] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 3 ms to minimize.
[2024-05-29 19:16:43] [INFO ] Deduced a trap composed of 221 places in 281 ms of which 3 ms to minimize.
[2024-05-29 19:16:44] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 3 ms to minimize.
[2024-05-29 19:16:44] [INFO ] Deduced a trap composed of 168 places in 301 ms of which 3 ms to minimize.
[2024-05-29 19:16:44] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 3 ms to minimize.
[2024-05-29 19:16:45] [INFO ] Deduced a trap composed of 168 places in 266 ms of which 3 ms to minimize.
[2024-05-29 19:16:45] [INFO ] Deduced a trap composed of 218 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 19:16:47] [INFO ] Deduced a trap composed of 167 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:16:47] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 2 ms to minimize.
[2024-05-29 19:16:48] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 3 ms to minimize.
[2024-05-29 19:16:49] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1679 variables, and 30 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/556 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/555 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (OVERLAPS) 1/556 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 19:17:02] [INFO ] Deduced a trap composed of 165 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:17:02] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
[2024-05-29 19:17:02] [INFO ] Deduced a trap composed of 170 places in 258 ms of which 2 ms to minimize.
[2024-05-29 19:17:03] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 3 ms to minimize.
[2024-05-29 19:17:03] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 168 places in 267 ms of which 3 ms to minimize.
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 163 places in 275 ms of which 3 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 2 ms to minimize.
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:17:09] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:17:10] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 2 ms to minimize.
[2024-05-29 19:17:10] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:17:10] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 169 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:17:19] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 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 556/1679 variables, and 53 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/556 constraints, PredecessorRefiner: 0/1122 constraints, Known Traps: 47/47 constraints]
After SMT, in 61940ms problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 61955ms
Starting structural reductions in LTL mode, iteration 1 : 556/571 places, 1123/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62773 ms. Remains : 556/571 places, 1123/1138 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 324 ms.
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 24 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLCardinality-01 finished in 63724 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))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 560 transition count 1127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 560 transition count 1127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 555 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 555 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 553 transition count 1120
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Applied a total of 40 rules in 58 ms. Remains 551 /571 variables (removed 20) and now considering 1118/1138 (removed 20) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-29 19:17:21] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 19:17:21] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 19:17:21] [INFO ] Invariant cache hit.
[2024-05-29 19:17:22] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-05-29 19:17:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 19:17:44] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 3 ms to minimize.
[2024-05-29 19:17:44] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 3 ms to minimize.
[2024-05-29 19:17:44] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 3 ms to minimize.
[2024-05-29 19:17:44] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:17:45] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 4 ms to minimize.
[2024-05-29 19:17:46] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 3 ms to minimize.
[2024-05-29 19:17:47] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 2 ms to minimize.
[2024-05-29 19:17:47] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 2 ms to minimize.
[2024-05-29 19:17:48] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:17:48] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 3 ms to minimize.
[2024-05-29 19:17:49] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 2 ms to minimize.
[2024-05-29 19:17:49] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 3 ms to minimize.
[2024-05-29 19:17:50] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:17:51] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 3 ms to minimize.
[2024-05-29 19:17:51] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2024-05-29 19:17:52] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:17:52] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:17:54] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 3 ms to minimize.
SMT process timed out in 32168ms, After SMT, problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 32182ms
Starting structural reductions in LTL mode, iteration 1 : 551/571 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32960 ms. Remains : 551/571 places, 1118/1138 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLCardinality-03 finished in 33490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)&&(X(G(p0))||p1))))))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 55 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:17:54] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 19:17:54] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 19:17:54] [INFO ] Invariant cache hit.
[2024-05-29 19:17:55] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:18:18] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 4 ms to minimize.
[2024-05-29 19:18:18] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:18:18] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:18:20] [INFO ] Deduced a trap composed of 163 places in 266 ms of which 3 ms to minimize.
[2024-05-29 19:18:20] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:18:20] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2024-05-29 19:18:21] [INFO ] Deduced a trap composed of 163 places in 218 ms of which 4 ms to minimize.
[2024-05-29 19:18:21] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:18:21] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:18:22] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 3 ms to minimize.
[2024-05-29 19:18:22] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:18:22] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
[2024-05-29 19:18:22] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:18:23] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:18:24] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2024-05-29 19:18:24] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-05-29 19:18:24] [INFO ] Deduced a trap composed of 163 places in 208 ms of which 2 ms to minimize.
[2024-05-29 19:18:25] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:18:26] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:18:27] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:18:39] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:18:46] [INFO ] Deduced a trap composed of 167 places in 254 ms of which 2 ms to minimize.
[2024-05-29 19:18:46] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:18:47] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 3 ms to minimize.
[2024-05-29 19:18:47] [INFO ] Deduced a trap composed of 166 places in 285 ms of which 3 ms to minimize.
[2024-05-29 19:18:47] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 2 ms to minimize.
[2024-05-29 19:18:48] [INFO ] Deduced a trap composed of 166 places in 285 ms of which 3 ms to minimize.
[2024-05-29 19:18:48] [INFO ] Deduced a trap composed of 164 places in 309 ms of which 4 ms to minimize.
[2024-05-29 19:18:48] [INFO ] Deduced a trap composed of 167 places in 292 ms of which 3 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 203 places in 275 ms of which 3 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:18:50] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:18:50] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62040ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62053ms
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62779 ms. Remains : 549/571 places, 1116/1138 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-04
Product exploration explored 100000 steps with 20000 reset in 138 ms.
Product exploration explored 100000 steps with 20000 reset in 140 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (444 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 995304 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 995304 steps, saw 167966 distinct states, run finished after 3004 ms. (steps per millisecond=331 ) properties seen :0
[2024-05-29 19:19:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/549 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/549 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 1 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1044 edges and 481 vertex of which 477 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 477 transition count 684
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 346 rules applied. Total rules applied 688 place count 141 transition count 674
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 695 place count 136 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 134 transition count 672
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 697 place count 134 transition count 647
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 747 place count 109 transition count 647
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 748 place count 109 transition count 646
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 800 place count 83 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 810 place count 83 transition count 610
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 831 place count 62 transition count 168
Iterating global reduction 6 with 21 rules applied. Total rules applied 852 place count 62 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 863 place count 62 transition count 157
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 868 place count 57 transition count 152
Iterating global reduction 7 with 5 rules applied. Total rules applied 873 place count 57 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 883 place count 52 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 889 place count 49 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 897 place count 49 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 899 place count 48 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 907 place count 48 transition count 145
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 933 place count 48 transition count 119
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 976 place count 22 transition count 102
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 981 place count 17 transition count 97
Iterating global reduction 8 with 5 rules applied. Total rules applied 986 place count 17 transition count 97
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1001 place count 17 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1017 place count 17 transition count 66
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1019 place count 17 transition count 66
Applied a total of 1019 rules in 62 ms. Remains 17 /549 variables (removed 532) and now considering 66/1116 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 17/549 places, 66/1116 transitions.
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 235 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-29 19:19:03] [INFO ] Invariant cache hit.
[2024-05-29 19:19:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 19:19:03] [INFO ] Invariant cache hit.
[2024-05-29 19:19:03] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:19:25] [INFO ] Deduced a trap composed of 164 places in 291 ms of which 3 ms to minimize.
[2024-05-29 19:19:25] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 2 ms to minimize.
[2024-05-29 19:19:26] [INFO ] Deduced a trap composed of 165 places in 251 ms of which 2 ms to minimize.
[2024-05-29 19:19:27] [INFO ] Deduced a trap composed of 163 places in 310 ms of which 3 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 2 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 165 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 165 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 2 ms to minimize.
[2024-05-29 19:19:30] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:19:30] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:19:31] [INFO ] Deduced a trap composed of 165 places in 241 ms of which 3 ms to minimize.
[2024-05-29 19:19:31] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:19:32] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:19:32] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:19:33] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 2 ms to minimize.
[2024-05-29 19:19:34] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:19:34] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
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 Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:19:50] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 2 ms to minimize.
[2024-05-29 19:19:50] [INFO ] Deduced a trap composed of 165 places in 235 ms of which 2 ms to minimize.
[2024-05-29 19:19:50] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:19:52] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:19:53] [INFO ] Deduced a trap composed of 167 places in 295 ms of which 3 ms to minimize.
[2024-05-29 19:19:54] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:19:55] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 2 ms to minimize.
[2024-05-29 19:19:55] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:19:55] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 3 ms to minimize.
[2024-05-29 19:19:56] [INFO ] Deduced a trap composed of 167 places in 281 ms of which 3 ms to minimize.
[2024-05-29 19:19:56] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 3 ms to minimize.
[2024-05-29 19:19:56] [INFO ] Deduced a trap composed of 164 places in 289 ms of which 3 ms to minimize.
[2024-05-29 19:19:57] [INFO ] Deduced a trap composed of 167 places in 315 ms of which 3 ms to minimize.
[2024-05-29 19:19:57] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:19:57] [INFO ] Deduced a trap composed of 203 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:19:58] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 6 ms to minimize.
[2024-05-29 19:19:58] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:19:58] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 61921ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61933ms
Finished structural reductions in LTL mode , in 1 iterations and 62639 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (448 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (78 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 986890 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 1
Probabilistic random walk after 986890 steps, saw 166668 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2024-05-29 19:20:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/549 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/549 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 2 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1044 edges and 481 vertex of which 477 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 477 transition count 684
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 346 rules applied. Total rules applied 688 place count 141 transition count 674
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 695 place count 136 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 134 transition count 672
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 697 place count 134 transition count 647
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 747 place count 109 transition count 647
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 748 place count 109 transition count 646
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 800 place count 83 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 810 place count 83 transition count 610
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 831 place count 62 transition count 168
Iterating global reduction 6 with 21 rules applied. Total rules applied 852 place count 62 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 863 place count 62 transition count 157
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 868 place count 57 transition count 152
Iterating global reduction 7 with 5 rules applied. Total rules applied 873 place count 57 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 883 place count 52 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 889 place count 49 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 897 place count 49 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 899 place count 48 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 907 place count 48 transition count 145
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 933 place count 48 transition count 119
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 976 place count 22 transition count 102
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 981 place count 17 transition count 97
Iterating global reduction 8 with 5 rules applied. Total rules applied 986 place count 17 transition count 97
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1001 place count 17 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1017 place count 17 transition count 66
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1019 place count 17 transition count 66
Applied a total of 1019 rules in 76 ms. Remains 17 /549 variables (removed 532) and now considering 66/1116 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 17/549 places, 66/1116 transitions.
RANDOM walk for 102 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 132 ms.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 329 place count 481 transition count 1038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 334 place count 481 transition count 1033
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 334 place count 481 transition count 1038
Deduced a syphon composed of 338 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 344 place count 481 transition count 1038
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 621 place count 204 transition count 761
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 277 rules applied. Total rules applied 898 place count 204 transition count 761
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 939 place count 204 transition count 761
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 996 place count 147 transition count 278
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 1053 place count 147 transition count 278
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1064 place count 147 transition count 267
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1085 place count 126 transition count 241
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1106 place count 126 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1111 place count 121 transition count 236
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1116 place count 121 transition count 236
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1124 place count 121 transition count 276
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1137 place count 108 transition count 250
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1150 place count 108 transition count 250
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 1164 place count 108 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1165 place count 108 transition count 249
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1166 place count 107 transition count 247
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1167 place count 107 transition count 247
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1171 place count 107 transition count 243
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 1171 rules in 155 ms. Remains 107 /549 variables (removed 442) and now considering 243/1116 (removed 873) transitions.
[2024-05-29 19:20:11] [INFO ] Redundant transitions in 9 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-29 19:20:11] [INFO ] Flow matrix only has 237 transitions (discarded 6 similar events)
// Phase 1: matrix 237 rows 107 cols
[2024-05-29 19:20:11] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 19:20:11] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 20 places in 369 ms of which 1 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD183 is UNSAT
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 19/22 constraints. Problems are: Problem set: 39 solved, 200 unsolved
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:20:15] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 19 ms to minimize.
[2024-05-29 19:20:16] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 39 solved, 200 unsolved
[2024-05-29 19:20:17] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/27 constraints. Problems are: Problem set: 39 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 39 solved, 200 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 6 (OVERLAPS) 236/343 variables, 107/134 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 35/169 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/169 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/170 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/170 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/170 constraints. Problems are: Problem set: 80 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 170 constraints, problems are : Problem set: 80 solved, 159 unsolved in 10703 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 80 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 49/107 variables, 3/3 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 24/27 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 236/343 variables, 107/134 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 35/169 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 159/328 constraints. Problems are: Problem set: 80 solved, 159 unsolved
[2024-05-29 19:20:25] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:20:26] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:20:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 3/331 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/331 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/332 constraints. Problems are: Problem set: 80 solved, 159 unsolved
[2024-05-29 19:20:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 2/334 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/334 constraints. Problems are: Problem set: 80 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/344 variables, 0/334 constraints. Problems are: Problem set: 80 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 334 constraints, problems are : Problem set: 80 solved, 159 unsolved in 19967 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 159/239 constraints, Known Traps: 29/29 constraints]
After SMT, in 30831ms problems are : Problem set: 80 solved, 159 unsolved
Search for dead transitions found 80 dead transitions in 30833ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/549 places, 163/1116 transitions.
Graph (complete) has 364 edges and 107 vertex of which 59 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 59 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 9 ms. Remains 59 /107 variables (removed 48) and now considering 163/163 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/549 places, 163/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31032 ms. Remains : 59/549 places, 163/1116 transitions.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:20:42] [INFO ] Computed 6 invariants in 40 ms
[2024-05-29 19:20:43] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-29 19:20:43] [INFO ] Invariant cache hit.
[2024-05-29 19:20:43] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:21:06] [INFO ] Deduced a trap composed of 164 places in 315 ms of which 3 ms to minimize.
[2024-05-29 19:21:07] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 2 ms to minimize.
[2024-05-29 19:21:07] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:21:08] [INFO ] Deduced a trap composed of 163 places in 279 ms of which 2 ms to minimize.
[2024-05-29 19:21:09] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 2 ms to minimize.
[2024-05-29 19:21:09] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:21:09] [INFO ] Deduced a trap composed of 163 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:21:10] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:21:10] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 2 ms to minimize.
[2024-05-29 19:21:10] [INFO ] Deduced a trap composed of 165 places in 260 ms of which 2 ms to minimize.
[2024-05-29 19:21:11] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:21:11] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:21:11] [INFO ] Deduced a trap composed of 163 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:21:12] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 166 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
SMT process timed out in 32078ms, After SMT, problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 32093ms
Finished structural reductions in LTL mode , in 1 iterations and 33062 ms. Remains : 549/549 places, 1116/1116 transitions.
Treatment of property StigmergyElection-PT-05b-LTLCardinality-04 finished in 201212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Graph (trivial) has 577 edges and 571 vertex of which 80 / 571 are part of one of the 14 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 504 transition count 715
Reduce places removed 347 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 358 rules applied. Total rules applied 706 place count 157 transition count 704
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 713 place count 151 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 714 place count 150 transition count 703
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 714 place count 150 transition count 685
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 750 place count 132 transition count 685
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 758 place count 124 transition count 676
Iterating global reduction 4 with 8 rules applied. Total rules applied 766 place count 124 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 766 place count 124 transition count 675
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 768 place count 123 transition count 675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 769 place count 122 transition count 673
Iterating global reduction 4 with 1 rules applied. Total rules applied 770 place count 122 transition count 673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 771 place count 121 transition count 671
Iterating global reduction 4 with 1 rules applied. Total rules applied 772 place count 121 transition count 671
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 812 place count 101 transition count 651
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 829 place count 84 transition count 234
Iterating global reduction 4 with 17 rules applied. Total rules applied 846 place count 84 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 854 place count 84 transition count 226
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 857 place count 81 transition count 220
Iterating global reduction 5 with 3 rules applied. Total rules applied 860 place count 81 transition count 220
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 862 place count 79 transition count 216
Iterating global reduction 5 with 2 rules applied. Total rules applied 864 place count 79 transition count 216
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 888 place count 67 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 889 place count 66 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 890 place count 66 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 891 place count 66 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 898 place count 66 transition count 202
Applied a total of 898 rules in 70 ms. Remains 66 /571 variables (removed 505) and now considering 202/1138 (removed 936) transitions.
[2024-05-29 19:21:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 66 cols
[2024-05-29 19:21:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:21:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 19:21:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-29 19:21:16] [INFO ] Invariant cache hit.
[2024-05-29 19:21:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:21:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-29 19:21:16] [INFO ] Redundant transitions in 8 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-29 19:21:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-29 19:21:16] [INFO ] Invariant cache hit.
[2024-05-29 19:21:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 195/261 variables, 66/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 1/262 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 0/262 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 125 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 195/261 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 185/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 1/262 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 311 constraints, problems are : Problem set: 0 solved, 185 unsolved in 15731 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 27/27 constraints]
After SMT, in 26091ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 26093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/571 places, 202/1138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26663 ms. Remains : 66/571 places, 202/1138 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-07 finished in 26799 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&&(X(!p0)||p1))))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 561 transition count 1128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 561 transition count 1128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 557 transition count 1124
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 557 transition count 1124
Applied a total of 28 rules in 37 ms. Remains 557 /571 variables (removed 14) and now considering 1124/1138 (removed 14) transitions.
// Phase 1: matrix 1124 rows 557 cols
[2024-05-29 19:21:42] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 19:21:42] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 19:21:42] [INFO ] Invariant cache hit.
[2024-05-29 19:21:43] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2024-05-29 19:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 19:22:04] [INFO ] Deduced a trap composed of 163 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:22:04] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 2 ms to minimize.
[2024-05-29 19:22:04] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:22:05] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 3 ms to minimize.
[2024-05-29 19:22:05] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:22:06] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:22:06] [INFO ] Deduced a trap composed of 168 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:22:06] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:22:07] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:22:07] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 3 ms to minimize.
[2024-05-29 19:22:07] [INFO ] Deduced a trap composed of 165 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:22:07] [INFO ] Deduced a trap composed of 169 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:22:08] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:22:08] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:22:08] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:22:08] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 2 ms to minimize.
[2024-05-29 19:22:10] [INFO ] Deduced a trap composed of 168 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:22:10] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:22:11] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:22:12] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 19:22:13] [INFO ] Deduced a trap composed of 219 places in 260 ms of which 3 ms to minimize.
[2024-05-29 19:22:13] [INFO ] Deduced a trap composed of 169 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:22:13] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/1681 variables, and 29 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1123/1123 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 1 (OVERLAPS) 1/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 19:22:27] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:22:27] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:22:28] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 2 ms to minimize.
[2024-05-29 19:22:29] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 170 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:22:31] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:22:31] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:22:34] [INFO ] Deduced a trap composed of 167 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:22:35] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:22:35] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:22:35] [INFO ] Deduced a trap composed of 219 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:22:36] [INFO ] Deduced a trap composed of 163 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:22:37] [INFO ] Deduced a trap composed of 223 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:22:37] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:22:38] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:22:38] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 3 ms to minimize.
[2024-05-29 19:22:39] [INFO ] Deduced a trap composed of 171 places in 260 ms of which 3 ms to minimize.
[2024-05-29 19:22:39] [INFO ] Deduced a trap composed of 218 places in 242 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
[2024-05-29 19:22:42] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 2 ms to minimize.
[2024-05-29 19:22:42] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:22:43] [INFO ] Deduced a trap composed of 165 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/1681 variables, and 52 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1123 constraints, Known Traps: 46/46 constraints]
After SMT, in 62151ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 62163ms
Starting structural reductions in LTL mode, iteration 1 : 557/571 places, 1124/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62889 ms. Remains : 557/571 places, 1124/1138 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, p0]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-09
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-09 finished in 63019 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((X(p0)&&((!p1&&X(p1))||X(G(p1)))))))'
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 561 transition count 1128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 561 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 555 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 555 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 553 transition count 1120
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Applied a total of 40 rules in 59 ms. Remains 551 /571 variables (removed 20) and now considering 1118/1138 (removed 20) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-29 19:22:45] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 19:22:46] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 19:22:46] [INFO ] Invariant cache hit.
[2024-05-29 19:22:46] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-05-29 19:22:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 19:23:08] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 4 ms to minimize.
[2024-05-29 19:23:09] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 3 ms to minimize.
[2024-05-29 19:23:09] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 219 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:23:13] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 2 ms to minimize.
[2024-05-29 19:23:13] [INFO ] Deduced a trap composed of 221 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:23:13] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 2 ms to minimize.
[2024-05-29 19:23:14] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:23:14] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 2 ms to minimize.
[2024-05-29 19:23:14] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 3 ms to minimize.
[2024-05-29 19:23:16] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 3 ms to minimize.
[2024-05-29 19:23:16] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:23:17] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:23:17] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:23:17] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 2 ms to minimize.
[2024-05-29 19:23:17] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1669 variables, and 24 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 19:23:33] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:23:34] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-05-29 19:23:36] [INFO ] Deduced a trap composed of 220 places in 270 ms of which 3 ms to minimize.
[2024-05-29 19:23:37] [INFO ] Deduced a trap composed of 165 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:23:37] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:23:37] [INFO ] Deduced a trap composed of 168 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:23:38] [INFO ] Deduced a trap composed of 220 places in 288 ms of which 4 ms to minimize.
[2024-05-29 19:23:38] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:23:38] [INFO ] Deduced a trap composed of 164 places in 293 ms of which 4 ms to minimize.
[2024-05-29 19:23:39] [INFO ] Deduced a trap composed of 167 places in 282 ms of which 3 ms to minimize.
[2024-05-29 19:23:39] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 3 ms to minimize.
[2024-05-29 19:23:39] [INFO ] Deduced a trap composed of 177 places in 285 ms of which 4 ms to minimize.
[2024-05-29 19:23:40] [INFO ] Deduced a trap composed of 182 places in 266 ms of which 3 ms to minimize.
[2024-05-29 19:23:40] [INFO ] Deduced a trap composed of 167 places in 257 ms of which 2 ms to minimize.
[2024-05-29 19:23:40] [INFO ] Deduced a trap composed of 221 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:23:40] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:23:41] [INFO ] Deduced a trap composed of 168 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:23:41] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:23:41] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 2 ms to minimize.
[2024-05-29 19:23:41] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1669 variables, and 44 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 38/38 constraints]
After SMT, in 62333ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62345ms
Starting structural reductions in LTL mode, iteration 1 : 551/571 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63098 ms. Remains : 551/571 places, 1118/1138 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 408 steps with 4 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-11 finished in 63263 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)))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 62 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:23:49] [INFO ] Computed 6 invariants in 10 ms
[2024-05-29 19:23:49] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 19:23:49] [INFO ] Invariant cache hit.
[2024-05-29 19:23:49] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 4 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-05-29 19:24:12] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 2 ms to minimize.
[2024-05-29 19:24:14] [INFO ] Deduced a trap composed of 163 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:24:14] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:24:14] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 165 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 2 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 2 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:24:18] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:24:18] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:24:19] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:24:19] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 2 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 19:24:33] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:24:36] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2024-05-29 19:24:36] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:24:37] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:24:39] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-29 19:24:39] [INFO ] Deduced a trap composed of 167 places in 273 ms of which 3 ms to minimize.
[2024-05-29 19:24:40] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:24:41] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 3 ms to minimize.
[2024-05-29 19:24:41] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 2 ms to minimize.
[2024-05-29 19:24:42] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 3 ms to minimize.
[2024-05-29 19:24:42] [INFO ] Deduced a trap composed of 167 places in 253 ms of which 3 ms to minimize.
[2024-05-29 19:24:42] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 3 ms to minimize.
[2024-05-29 19:24:43] [INFO ] Deduced a trap composed of 164 places in 307 ms of which 3 ms to minimize.
[2024-05-29 19:24:43] [INFO ] Deduced a trap composed of 167 places in 273 ms of which 3 ms to minimize.
[2024-05-29 19:24:43] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 2 ms to minimize.
[2024-05-29 19:24:44] [INFO ] Deduced a trap composed of 203 places in 264 ms of which 2 ms to minimize.
[2024-05-29 19:24:44] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:24:44] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:24:44] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62060ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62071ms
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62880 ms. Remains : 549/571 places, 1116/1138 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 600 steps with 6 reset in 3 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-13 finished in 63019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)&&(X(G(p0))||p1))))))'
[2024-05-29 19:24:52] [INFO ] Flatten gal took : 62 ms
[2024-05-29 19:24:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 19:24:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 571 places, 1138 transitions and 6485 arcs took 10 ms.
Total runtime 650929 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-05b

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: 571
TRANSITIONS: 1138
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.005s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 2441
MODEL NAME: /home/mcc/execution/411/model
571 places, 1138 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.
Building monolithic NSF...
FORMULA StigmergyElection-PT-05b-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717010849123

--------------------
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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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-171690530100307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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