Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532000306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyElection-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000306
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717245913197

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:45:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:45:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:45:14] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 12:45:14] [INFO ] Transformed 699 places.
[2024-06-01 12:45:14] [INFO ] Transformed 1266 transitions.
[2024-06-01 12:45:14] [INFO ] Found NUPN structural information;
[2024-06-01 12:45:14] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 129 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 631 transition count 1198
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 631 transition count 1198
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 167 place count 600 transition count 1167
Iterating global reduction 0 with 31 rules applied. Total rules applied 198 place count 600 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 598 transition count 1165
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 598 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 204 place count 596 transition count 1163
Iterating global reduction 0 with 2 rules applied. Total rules applied 206 place count 596 transition count 1163
Applied a total of 206 rules in 173 ms. Remains 596 /699 variables (removed 103) and now considering 1163/1266 (removed 103) transitions.
// Phase 1: matrix 1163 rows 596 cols
[2024-06-01 12:45:14] [INFO ] Computed 6 invariants in 34 ms
[2024-06-01 12:45:15] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 12:45:15] [INFO ] Invariant cache hit.
[2024-06-01 12:45:15] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 1162 sub problems to find dead transitions.
[2024-06-01 12:45:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-06-01 12:45:38] [INFO ] Deduced a trap composed of 170 places in 341 ms of which 27 ms to minimize.
[2024-06-01 12:45:39] [INFO ] Deduced a trap composed of 174 places in 268 ms of which 3 ms to minimize.
[2024-06-01 12:45:39] [INFO ] Deduced a trap composed of 173 places in 260 ms of which 4 ms to minimize.
[2024-06-01 12:45:39] [INFO ] Deduced a trap composed of 174 places in 232 ms of which 3 ms to minimize.
[2024-06-01 12:45:40] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 2 ms to minimize.
[2024-06-01 12:45:40] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 2 ms to minimize.
[2024-06-01 12:45:40] [INFO ] Deduced a trap composed of 101 places in 239 ms of which 2 ms to minimize.
[2024-06-01 12:45:41] [INFO ] Deduced a trap composed of 464 places in 396 ms of which 4 ms to minimize.
[2024-06-01 12:45:41] [INFO ] Deduced a trap composed of 175 places in 284 ms of which 2 ms to minimize.
[2024-06-01 12:45:43] [INFO ] Deduced a trap composed of 179 places in 322 ms of which 4 ms to minimize.
[2024-06-01 12:45:44] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 3 ms to minimize.
[2024-06-01 12:45:44] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:45:48] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1759 variables, and 19 constraints, problems are : Problem set: 0 solved, 1162 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 1162/1162 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 4 ms to minimize.
[2024-06-01 12:46:03] [INFO ] Deduced a trap composed of 173 places in 222 ms of which 3 ms to minimize.
[2024-06-01 12:46:04] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 2 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 3 ms to minimize.
[2024-06-01 12:46:07] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 2 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 3 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 172 places in 260 ms of which 3 ms to minimize.
[2024-06-01 12:46:11] [INFO ] Deduced a trap composed of 173 places in 291 ms of which 4 ms to minimize.
[2024-06-01 12:46:11] [INFO ] Deduced a trap composed of 174 places in 275 ms of which 3 ms to minimize.
[2024-06-01 12:46:11] [INFO ] Deduced a trap composed of 174 places in 285 ms of which 3 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 178 places in 279 ms of which 3 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 229 places in 321 ms of which 4 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 177 places in 271 ms of which 3 ms to minimize.
[2024-06-01 12:46:13] [INFO ] Deduced a trap composed of 172 places in 264 ms of which 3 ms to minimize.
[2024-06-01 12:46:13] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 2 ms to minimize.
[2024-06-01 12:46:13] [INFO ] Deduced a trap composed of 172 places in 231 ms of which 3 ms to minimize.
[2024-06-01 12:46:14] [INFO ] Deduced a trap composed of 178 places in 231 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/1759 variables, and 39 constraints, problems are : Problem set: 0 solved, 1162 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 0/1162 constraints, Known Traps: 33/33 constraints]
After SMT, in 62491ms problems are : Problem set: 0 solved, 1162 unsolved
Search for dead transitions found 0 dead transitions in 62527ms
Starting structural reductions in LTL mode, iteration 1 : 596/699 places, 1163/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63538 ms. Remains : 596/699 places, 1163/1266 transitions.
Support contains 129 out of 596 places after structural reductions.
[2024-06-01 12:46:18] [INFO ] Flatten gal took : 131 ms
[2024-06-01 12:46:18] [INFO ] Flatten gal took : 81 ms
[2024-06-01 12:46:18] [INFO ] Input system was already deterministic with 1163 transitions.
Support contains 127 out of 596 places (down from 129) after GAL structural reductions.
RANDOM walk for 40000 steps (442 resets) in 2065 ms. (19 steps per ms) remains 81/115 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
[2024-06-01 12:46:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp101 is UNSAT
At refinement iteration 1 (OVERLAPS) 504/596 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 74 unsolved
[2024-06-01 12:46:21] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 3 ms to minimize.
[2024-06-01 12:46:21] [INFO ] Deduced a trap composed of 100 places in 235 ms of which 7 ms to minimize.
[2024-06-01 12:46:21] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 2 ms to minimize.
[2024-06-01 12:46:22] [INFO ] Deduced a trap composed of 174 places in 249 ms of which 3 ms to minimize.
[2024-06-01 12:46:22] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:46:22] [INFO ] Deduced a trap composed of 101 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 4 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 2 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:46:23] [INFO ] Deduced a trap composed of 98 places in 241 ms of which 3 ms to minimize.
[2024-06-01 12:46:24] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 11/17 constraints. Problems are: Problem set: 7 solved, 74 unsolved
[2024-06-01 12:46:24] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2024-06-01 12:46:25] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 2 ms to minimize.
SMT process timed out in 5483ms, After SMT, problems are : Problem set: 7 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 456 edges and 596 vertex of which 47 / 596 are part of one of the 9 SCC in 4 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 1131 edges and 558 vertex of which 554 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 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 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 554 transition count 829
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 283 rules applied. Total rules applied 567 place count 276 transition count 824
Reduce places removed 2 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 48 rules applied. Total rules applied 615 place count 274 transition count 778
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 54 rules applied. Total rules applied 669 place count 228 transition count 770
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 673 place count 224 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 673 place count 224 transition count 752
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 709 place count 206 transition count 752
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 711 place count 204 transition count 750
Iterating global reduction 5 with 2 rules applied. Total rules applied 713 place count 204 transition count 750
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 755 place count 183 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 756 place count 183 transition count 728
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 757 place count 182 transition count 727
Iterating global reduction 6 with 1 rules applied. Total rules applied 758 place count 182 transition count 727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 760 place count 181 transition count 726
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 770 place count 176 transition count 728
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 777 place count 176 transition count 721
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 785 place count 176 transition count 713
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 793 place count 168 transition count 713
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 796 place count 168 transition count 713
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 797 place count 168 transition count 712
Applied a total of 797 rules in 218 ms. Remains 168 /596 variables (removed 428) and now considering 712/1163 (removed 451) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 168/596 places, 712/1163 transitions.
RANDOM walk for 40000 steps (2131 resets) in 610 ms. (65 steps per ms) remains 54/74 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (37 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (32 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (33 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 50/54 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (31 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (34 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (31 resets) in 10 ms. (363 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (36 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (36 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
// Phase 1: matrix 712 rows 168 cols
[2024-06-01 12:46:26] [INFO ] Computed 6 invariants in 8 ms
[2024-06-01 12:46:26] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 712/880 variables, 168/174 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 16/190 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/880 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/880 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 190 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 712/880 variables, 168/174 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 16/190 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/880 variables, 45/235 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/880 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/880 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 235 constraints, problems are : Problem set: 2 solved, 45 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 7859ms problems are : Problem set: 2 solved, 45 unsolved
Parikh walk visited 4 properties in 3205 ms.
Support contains 49 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 712/712 transitions.
Graph (trivial) has 91 edges and 168 vertex of which 13 / 168 are part of one of the 4 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 159 transition count 681
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 141 transition count 678
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 140 transition count 675
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 48 place count 137 transition count 674
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 48 place count 137 transition count 672
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 52 place count 135 transition count 672
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 59 place count 128 transition count 665
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 128 transition count 665
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 128 transition count 663
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 126 transition count 663
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 125 transition count 661
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 125 transition count 661
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 86 place count 118 transition count 654
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 118 transition count 652
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 117 transition count 650
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 117 transition count 650
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 92 place count 116 transition count 650
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 96 place count 116 transition count 646
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 128 place count 116 transition count 614
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 160 place count 84 transition count 614
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 84 transition count 614
Applied a total of 161 rules in 154 ms. Remains 84 /168 variables (removed 84) and now considering 614/712 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 84/168 places, 614/712 transitions.
RANDOM walk for 40000 steps (3322 resets) in 639 ms. (62 steps per ms) remains 29/41 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (61 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (50 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 7 ms. (500 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 8 ms. (444 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (53 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (49 resets) in 8 ms. (444 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (23 resets) in 5 ms. (667 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (16 resets) in 6 ms. (572 steps per ms) remains 8/9 properties
// Phase 1: matrix 614 rows 84 cols
[2024-06-01 12:46:37] [INFO ] Computed 6 invariants in 8 ms
[2024-06-01 12:46:37] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 63/84 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 12:46:37] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 614/698 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 48/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/698 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 139 constraints, problems are : Problem set: 0 solved, 8 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 63/84 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 614/698 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 48/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/698 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 147 constraints, problems are : Problem set: 0 solved, 8 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 1032 ms.
Support contains 15 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 614/614 transitions.
Graph (trivial) has 43 edges and 84 vertex of which 4 / 84 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 417 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 81 transition count 606
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 604
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 76 transition count 604
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 76 transition count 603
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 75 transition count 603
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 24 place count 66 transition count 255
Iterating global reduction 3 with 9 rules applied. Total rules applied 33 place count 66 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 40 place count 66 transition count 248
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 65 transition count 246
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 65 transition count 246
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 48 place count 62 transition count 243
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 49 place count 62 transition count 242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 50 place count 61 transition count 241
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 61 transition count 241
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 5 with 6 rules applied. Total rules applied 57 place count 58 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 65 place count 58 transition count 241
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 82 place count 58 transition count 224
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 102 place count 41 transition count 221
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 109 place count 41 transition count 214
Applied a total of 109 rules in 75 ms. Remains 41 /84 variables (removed 43) and now considering 214/614 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 41/84 places, 214/614 transitions.
RANDOM walk for 22773 steps (166 resets) in 112 ms. (201 steps per ms) remains 0/6 properties
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-01 12:46:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 55 ms
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 56 ms
[2024-06-01 12:46:40] [INFO ] Input system was already deterministic with 1163 transitions.
Support contains 104 out of 596 places (down from 119) after GAL structural reductions.
Computed a total of 80 stabilizing places and 85 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 608 edges and 596 vertex of which 86 / 596 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 524 transition count 709
Reduce places removed 372 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 382 rules applied. Total rules applied 755 place count 152 transition count 699
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 761 place count 147 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 762 place count 146 transition count 698
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 762 place count 146 transition count 683
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 792 place count 131 transition count 683
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 805 place count 118 transition count 670
Iterating global reduction 4 with 13 rules applied. Total rules applied 818 place count 118 transition count 670
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 818 place count 118 transition count 667
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 824 place count 115 transition count 667
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 827 place count 112 transition count 584
Iterating global reduction 4 with 3 rules applied. Total rules applied 830 place count 112 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 831 place count 112 transition count 583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 832 place count 111 transition count 582
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 111 transition count 582
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 867 place count 94 transition count 565
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 885 place count 76 transition count 201
Iterating global reduction 5 with 18 rules applied. Total rules applied 903 place count 76 transition count 201
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 913 place count 76 transition count 191
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 918 place count 71 transition count 181
Iterating global reduction 6 with 5 rules applied. Total rules applied 923 place count 71 transition count 181
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 928 place count 66 transition count 176
Iterating global reduction 6 with 5 rules applied. Total rules applied 933 place count 66 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 938 place count 66 transition count 171
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 6 with 10 rules applied. Total rules applied 948 place count 61 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 949 place count 60 transition count 165
Applied a total of 949 rules in 94 ms. Remains 60 /596 variables (removed 536) and now considering 165/1163 (removed 998) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 60/596 places, 165/1163 transitions.
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:46:40] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 574 transition count 1141
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 574 transition count 1141
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 562 transition count 1129
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 562 transition count 1129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 559 transition count 1126
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 559 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 558 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 558 transition count 1125
Applied a total of 76 rules in 100 ms. Remains 558 /596 variables (removed 38) and now considering 1125/1163 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 558/596 places, 1125/1163 transitions.
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 45 ms
[2024-06-01 12:46:40] [INFO ] Flatten gal took : 47 ms
[2024-06-01 12:46:40] [INFO ] Input system was already deterministic with 1125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 573 transition count 1140
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 573 transition count 1140
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 562 transition count 1129
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 562 transition count 1129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 559 transition count 1126
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 559 transition count 1126
Applied a total of 74 rules in 80 ms. Remains 559 /596 variables (removed 37) and now considering 1126/1163 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 559/596 places, 1126/1163 transitions.
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 44 ms
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 46 ms
[2024-06-01 12:46:41] [INFO ] Input system was already deterministic with 1126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 556 transition count 1123
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 556 transition count 1123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 552 transition count 1119
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 551 transition count 1118
Applied a total of 90 rules in 61 ms. Remains 551 /596 variables (removed 45) and now considering 1118/1163 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 551/596 places, 1118/1163 transitions.
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 43 ms
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 45 ms
[2024-06-01 12:46:41] [INFO ] Input system was already deterministic with 1118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 555 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 550 transition count 1117
Applied a total of 92 rules in 57 ms. Remains 550 /596 variables (removed 46) and now considering 1117/1163 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 550/596 places, 1117/1163 transitions.
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 43 ms
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 44 ms
[2024-06-01 12:46:41] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 49 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 37 ms
[2024-06-01 12:46:41] [INFO ] Flatten gal took : 39 ms
[2024-06-01 12:46:41] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 52 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 39 ms
[2024-06-01 12:46:42] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 557 transition count 1124
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 557 transition count 1124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 555 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 554 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 554 transition count 1121
Applied a total of 84 rules in 52 ms. Remains 554 /596 variables (removed 42) and now considering 1121/1163 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 554/596 places, 1121/1163 transitions.
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 37 ms
[2024-06-01 12:46:42] [INFO ] Input system was already deterministic with 1121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 71 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 33 ms
[2024-06-01 12:46:42] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 47 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 33 ms
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 34 ms
[2024-06-01 12:46:42] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 600 edges and 596 vertex of which 86 / 596 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 366 rules applied. Total rules applied 367 place count 524 transition count 715
Reduce places removed 366 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 376 rules applied. Total rules applied 743 place count 158 transition count 705
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 749 place count 153 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 152 transition count 704
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 750 place count 152 transition count 689
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 780 place count 137 transition count 689
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 792 place count 125 transition count 677
Iterating global reduction 4 with 12 rules applied. Total rules applied 804 place count 125 transition count 677
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 804 place count 125 transition count 675
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 808 place count 123 transition count 675
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 811 place count 120 transition count 592
Iterating global reduction 4 with 3 rules applied. Total rules applied 814 place count 120 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 815 place count 120 transition count 591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 816 place count 119 transition count 590
Iterating global reduction 5 with 1 rules applied. Total rules applied 817 place count 119 transition count 590
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 853 place count 101 transition count 572
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 866 place count 88 transition count 354
Iterating global reduction 5 with 13 rules applied. Total rules applied 879 place count 88 transition count 354
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 884 place count 88 transition count 349
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 889 place count 83 transition count 339
Iterating global reduction 6 with 5 rules applied. Total rules applied 894 place count 83 transition count 339
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 899 place count 78 transition count 334
Iterating global reduction 6 with 5 rules applied. Total rules applied 904 place count 78 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 909 place count 78 transition count 329
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 6 with 10 rules applied. Total rules applied 919 place count 73 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 920 place count 72 transition count 323
Applied a total of 920 rules in 80 ms. Remains 72 /596 variables (removed 524) and now considering 323/1163 (removed 840) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 72/596 places, 323/1163 transitions.
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:46:42] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:46:42] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 557 transition count 1124
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 557 transition count 1124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 552 transition count 1119
Applied a total of 88 rules in 45 ms. Remains 552 /596 variables (removed 44) and now considering 1119/1163 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 552/596 places, 1119/1163 transitions.
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 32 ms
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:46:43] [INFO ] Input system was already deterministic with 1119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 569 transition count 1136
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 569 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 68 place count 555 transition count 1122
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 550 transition count 1117
Applied a total of 92 rules in 47 ms. Remains 550 /596 variables (removed 46) and now considering 1117/1163 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 550/596 places, 1117/1163 transitions.
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 32 ms
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:46:43] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 49 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 31 ms
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 34 ms
[2024-06-01 12:46:43] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 34 ms
[2024-06-01 12:46:43] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:46:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 12:46:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 1163 transitions and 6535 arcs took 10 ms.
Total runtime 89431 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-01
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-02
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-03
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-04
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-05
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-06
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-07
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-08
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-09
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2024-10
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2023-12
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2023-13
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2023-14
Could not compute solution for formula : StigmergyElection-PT-05b-CTLFireability-2023-15

BK_STOP 1717246004177

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/684/ctl_0_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/684/ctl_1_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/684/ctl_2_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/684/ctl_3_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/684/ctl_4_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/684/ctl_5_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/684/ctl_6_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/684/ctl_7_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/684/ctl_8_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/684/ctl_9_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/684/ctl_10_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/684/ctl_11_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/684/ctl_12_
ctl formula name StigmergyElection-PT-05b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/684/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-05b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532000306"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;